./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec27_product30.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_spec27_product30.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 77340ea3311b00efe6580b7964ad9e7e4d288fea0ba2d6706c8abdac4c4c4bb5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 03:52:16,505 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 03:52:16,565 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:52:16,570 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 03:52:16,573 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 03:52:16,594 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 03:52:16,595 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 03:52:16,595 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 03:52:16,595 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 03:52:16,596 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 03:52:16,596 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 03:52:16,597 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 03:52:16,597 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 03:52:16,597 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 03:52:16,597 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 03:52:16,597 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 03:52:16,597 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 03:52:16,597 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 03:52:16,597 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 03:52:16,597 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 03:52:16,597 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 03:52:16,597 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 03:52:16,597 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 03:52:16,597 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 03:52:16,597 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 03:52:16,597 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 03:52:16,597 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 03:52:16,597 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 03:52:16,598 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 03:52:16,598 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:52:16,598 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:52:16,598 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:52:16,598 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:52:16,598 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 03:52:16,598 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:52:16,598 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:52:16,598 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:52:16,598 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:52:16,598 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 03:52:16,598 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 03:52:16,598 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 03:52:16,598 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 03:52:16,598 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 03:52:16,598 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 03:52:16,598 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 03:52:16,598 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 03:52:16,598 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 03:52:16,599 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 03:52:16,599 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 -> 77340ea3311b00efe6580b7964ad9e7e4d288fea0ba2d6706c8abdac4c4c4bb5 [2025-01-09 03:52:16,854 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 03:52:16,869 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 03:52:16,871 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 03:52:16,872 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 03:52:16,872 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 03:52:16,874 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec27_product30.cil.c [2025-01-09 03:52:18,061 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0ea2b031b/0863575a9fb149afbdb8cdbcb25f97e9/FLAGed5d4d02f [2025-01-09 03:52:18,474 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 03:52:18,474 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec27_product30.cil.c [2025-01-09 03:52:18,486 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0ea2b031b/0863575a9fb149afbdb8cdbcb25f97e9/FLAGed5d4d02f [2025-01-09 03:52:18,663 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0ea2b031b/0863575a9fb149afbdb8cdbcb25f97e9 [2025-01-09 03:52:18,665 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 03:52:18,666 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 03:52:18,667 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 03:52:18,667 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 03:52:18,670 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 03:52:18,670 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:52:18" (1/1) ... [2025-01-09 03:52:18,671 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b5c6ea3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:18, skipping insertion in model container [2025-01-09 03:52:18,671 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:52:18" (1/1) ... [2025-01-09 03:52:18,715 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 03:52:19,101 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_spec27_product30.cil.c[47628,47641] [2025-01-09 03:52:19,184 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:52:19,196 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 03:52:19,203 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [48] [2025-01-09 03:52:19,204 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [1128] [2025-01-09 03:52:19,204 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [1146] [2025-01-09 03:52:19,204 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [1371] [2025-01-09 03:52:19,204 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"VerifyForward_spec.i","") [1420] [2025-01-09 03:52:19,204 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [1455] [2025-01-09 03:52:19,204 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [1828] [2025-01-09 03:52:19,204 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [2226] [2025-01-09 03:52:19,205 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [2235] [2025-01-09 03:52:19,205 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2371] [2025-01-09 03:52:19,206 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2737] [2025-01-09 03:52:19,264 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_spec27_product30.cil.c[47628,47641] [2025-01-09 03:52:19,293 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:52:19,323 INFO L204 MainTranslator]: Completed translation [2025-01-09 03:52:19,326 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:19 WrapperNode [2025-01-09 03:52:19,326 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 03:52:19,327 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 03:52:19,327 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 03:52:19,327 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 03:52:19,332 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:52:19" (1/1) ... [2025-01-09 03:52:19,357 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:52:19" (1/1) ... [2025-01-09 03:52:19,412 INFO L138 Inliner]: procedures = 131, calls = 205, calls flagged for inlining = 59, calls inlined = 50, statements flattened = 915 [2025-01-09 03:52:19,412 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 03:52:19,413 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 03:52:19,413 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 03:52:19,413 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 03:52:19,420 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:19" (1/1) ... [2025-01-09 03:52:19,420 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:19" (1/1) ... [2025-01-09 03:52:19,424 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:19" (1/1) ... [2025-01-09 03:52:19,455 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:52:19,455 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:19" (1/1) ... [2025-01-09 03:52:19,456 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:19" (1/1) ... [2025-01-09 03:52:19,475 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:19" (1/1) ... [2025-01-09 03:52:19,481 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:19" (1/1) ... [2025-01-09 03:52:19,486 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:19" (1/1) ... [2025-01-09 03:52:19,493 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:19" (1/1) ... [2025-01-09 03:52:19,500 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:19" (1/1) ... [2025-01-09 03:52:19,512 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 03:52:19,516 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 03:52:19,516 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 03:52:19,516 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 03:52:19,517 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:19" (1/1) ... [2025-01-09 03:52:19,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:52:19,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:52:19,547 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:52:19,551 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:52:19,570 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2025-01-09 03:52:19,570 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2025-01-09 03:52:19,570 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-01-09 03:52:19,570 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-01-09 03:52:19,571 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-01-09 03:52:19,571 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-01-09 03:52:19,571 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-01-09 03:52:19,571 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-01-09 03:52:19,571 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-01-09 03:52:19,571 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-01-09 03:52:19,571 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-01-09 03:52:19,571 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-01-09 03:52:19,571 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-01-09 03:52:19,572 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-01-09 03:52:19,572 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-01-09 03:52:19,572 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-01-09 03:52:19,572 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-01-09 03:52:19,572 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-01-09 03:52:19,572 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-01-09 03:52:19,572 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-01-09 03:52:19,572 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-01-09 03:52:19,572 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-01-09 03:52:19,572 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-01-09 03:52:19,572 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-01-09 03:52:19,572 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 03:52:19,573 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-01-09 03:52:19,573 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-01-09 03:52:19,573 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2025-01-09 03:52:19,573 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2025-01-09 03:52:19,573 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-01-09 03:52:19,573 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-01-09 03:52:19,573 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-01-09 03:52:19,573 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-01-09 03:52:19,573 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-01-09 03:52:19,573 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-01-09 03:52:19,573 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2025-01-09 03:52:19,574 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2025-01-09 03:52:19,574 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2025-01-09 03:52:19,574 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2025-01-09 03:52:19,574 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-01-09 03:52:19,574 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-01-09 03:52:19,574 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-01-09 03:52:19,574 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-01-09 03:52:19,574 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-01-09 03:52:19,574 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-01-09 03:52:19,574 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-01-09 03:52:19,574 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-01-09 03:52:19,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 03:52:19,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 03:52:19,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 03:52:19,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 03:52:19,575 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-01-09 03:52:19,575 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-01-09 03:52:19,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 03:52:19,575 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 03:52:19,729 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 03:52:19,731 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 03:52:20,461 INFO L? ?]: Removed 437 outVars from TransFormulas that were not future-live. [2025-01-09 03:52:20,461 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 03:52:20,485 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 03:52:20,489 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 03:52:20,489 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:52:20 BoogieIcfgContainer [2025-01-09 03:52:20,489 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 03:52:20,492 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 03:52:20,492 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 03:52:20,512 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 03:52:20,515 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:52:18" (1/3) ... [2025-01-09 03:52:20,516 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f5d0183 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:52:20, skipping insertion in model container [2025-01-09 03:52:20,516 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:19" (2/3) ... [2025-01-09 03:52:20,517 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f5d0183 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:52:20, skipping insertion in model container [2025-01-09 03:52:20,517 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:52:20" (3/3) ... [2025-01-09 03:52:20,518 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec27_product30.cil.c [2025-01-09 03:52:20,535 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 03:52:20,538 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec27_product30.cil.c that has 25 procedures, 353 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 03:52:20,607 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 03:52:20,618 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;@19bbdb7a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 03:52:20,619 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 03:52:20,625 INFO L276 IsEmpty]: Start isEmpty. Operand has 353 states, 273 states have (on average 1.5128205128205128) internal successors, (413), 277 states have internal predecessors, (413), 54 states have call successors, (54), 24 states have call predecessors, (54), 24 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-01-09 03:52:20,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-01-09 03:52:20,646 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:20,647 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:52:20,647 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:20,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:20,652 INFO L85 PathProgramCache]: Analyzing trace with hash 608177881, now seen corresponding path program 1 times [2025-01-09 03:52:20,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:20,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055084519] [2025-01-09 03:52:20,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:20,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:20,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-01-09 03:52:20,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-01-09 03:52:20,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:20,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:21,313 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-01-09 03:52:21,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:21,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055084519] [2025-01-09 03:52:21,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055084519] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:52:21,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [736192441] [2025-01-09 03:52:21,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:21,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:52:21,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:52:21,324 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:52:21,327 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:52:21,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-01-09 03:52:21,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-01-09 03:52:21,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:21,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:21,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 1182 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 03:52:21,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:52:21,696 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-01-09 03:52:21,697 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:52:21,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [736192441] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:21,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:52:21,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 03:52:21,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109639937] [2025-01-09 03:52:21,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:21,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:52:21,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:21,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:52:21,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:52:21,725 INFO L87 Difference]: Start difference. First operand has 353 states, 273 states have (on average 1.5128205128205128) internal successors, (413), 277 states have internal predecessors, (413), 54 states have call successors, (54), 24 states have call predecessors, (54), 24 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) 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, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 03:52:21,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:21,807 INFO L93 Difference]: Finished difference Result 555 states and 802 transitions. [2025-01-09 03:52:21,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:52:21,809 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, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 142 [2025-01-09 03:52:21,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:21,817 INFO L225 Difference]: With dead ends: 555 [2025-01-09 03:52:21,818 INFO L226 Difference]: Without dead ends: 348 [2025-01-09 03:52:21,823 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 142 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:52:21,826 INFO L435 NwaCegarLoop]: 516 mSDtfsCounter, 1 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1029 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:52:21,828 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1029 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:52:21,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2025-01-09 03:52:21,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 347. [2025-01-09 03:52:21,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 268 states have (on average 1.507462686567164) internal successors, (404), 271 states have internal predecessors, (404), 54 states have call successors, (54), 24 states have call predecessors, (54), 24 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2025-01-09 03:52:21,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 511 transitions. [2025-01-09 03:52:21,880 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 511 transitions. Word has length 142 [2025-01-09 03:52:21,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:21,884 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 511 transitions. [2025-01-09 03:52:21,884 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, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 03:52:21,884 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 511 transitions. [2025-01-09 03:52:21,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-01-09 03:52:21,887 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:21,890 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:52:21,902 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:52:22,091 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:52:22,091 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:22,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:22,093 INFO L85 PathProgramCache]: Analyzing trace with hash -880325268, now seen corresponding path program 1 times [2025-01-09 03:52:22,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:22,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451980798] [2025-01-09 03:52:22,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:22,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:22,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-09 03:52:22,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-09 03:52:22,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:22,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:22,421 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-01-09 03:52:22,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:22,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451980798] [2025-01-09 03:52:22,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451980798] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:52:22,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [599817142] [2025-01-09 03:52:22,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:22,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:52:22,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:52:22,427 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:52:22,428 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:52:22,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-09 03:52:22,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-09 03:52:22,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:22,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:22,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 1206 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:52:22,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:52:22,762 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-01-09 03:52:22,764 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:52:22,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [599817142] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:22,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:52:22,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 03:52:22,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243838507] [2025-01-09 03:52:22,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:22,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:52:22,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:22,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:52:22,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:52:22,767 INFO L87 Difference]: Start difference. First operand 347 states and 511 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 03:52:22,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:22,803 INFO L93 Difference]: Finished difference Result 724 states and 1081 transitions. [2025-01-09 03:52:22,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:52:22,804 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 150 [2025-01-09 03:52:22,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:22,807 INFO L225 Difference]: With dead ends: 724 [2025-01-09 03:52:22,809 INFO L226 Difference]: Without dead ends: 403 [2025-01-09 03:52:22,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 150 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:52:22,812 INFO L435 NwaCegarLoop]: 525 mSDtfsCounter, 107 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 989 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:52:22,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 989 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:52:22,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2025-01-09 03:52:22,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 395. [2025-01-09 03:52:22,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 305 states have (on average 1.5245901639344261) internal successors, (465), 308 states have internal predecessors, (465), 65 states have call successors, (65), 24 states have call predecessors, (65), 24 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2025-01-09 03:52:22,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 594 transitions. [2025-01-09 03:52:22,853 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 594 transitions. Word has length 150 [2025-01-09 03:52:22,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:22,854 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 594 transitions. [2025-01-09 03:52:22,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 03:52:22,854 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 594 transitions. [2025-01-09 03:52:22,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-01-09 03:52:22,859 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:22,859 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:52:22,866 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:52:23,059 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:52:23,060 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:23,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:23,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1056520681, now seen corresponding path program 1 times [2025-01-09 03:52:23,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:23,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882637794] [2025-01-09 03:52:23,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:23,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:23,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 03:52:23,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 03:52:23,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:23,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:23,294 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-01-09 03:52:23,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:23,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882637794] [2025-01-09 03:52:23,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882637794] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:52:23,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [297235036] [2025-01-09 03:52:23,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:23,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:52:23,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:52:23,300 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:52:23,306 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:52:23,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 03:52:23,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 03:52:23,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:23,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:23,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 1211 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 03:52:23,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:52:23,623 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-09 03:52:23,624 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:52:23,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [297235036] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:23,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:52:23,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-01-09 03:52:23,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743169449] [2025-01-09 03:52:23,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:23,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:52:23,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:23,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:52:23,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:52:23,625 INFO L87 Difference]: Start difference. First operand 395 states and 594 transitions. Second operand has 5 states, 4 states have (on average 23.75) internal successors, (95), 5 states have internal predecessors, (95), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 03:52:23,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:23,677 INFO L93 Difference]: Finished difference Result 781 states and 1178 transitions. [2025-01-09 03:52:23,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:52:23,678 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 23.75) internal successors, (95), 5 states have internal predecessors, (95), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 151 [2025-01-09 03:52:23,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:23,685 INFO L225 Difference]: With dead ends: 781 [2025-01-09 03:52:23,685 INFO L226 Difference]: Without dead ends: 397 [2025-01-09 03:52:23,686 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 149 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:52:23,687 INFO L435 NwaCegarLoop]: 502 mSDtfsCounter, 2 mSDsluCounter, 1495 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1997 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:52:23,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1997 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:52:23,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2025-01-09 03:52:23,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2025-01-09 03:52:23,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 306 states have (on average 1.522875816993464) internal successors, (466), 310 states have internal predecessors, (466), 65 states have call successors, (65), 24 states have call predecessors, (65), 25 states have return successors, (66), 64 states have call predecessors, (66), 64 states have call successors, (66) [2025-01-09 03:52:23,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 597 transitions. [2025-01-09 03:52:23,719 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 597 transitions. Word has length 151 [2025-01-09 03:52:23,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:23,719 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 597 transitions. [2025-01-09 03:52:23,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 23.75) internal successors, (95), 5 states have internal predecessors, (95), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 03:52:23,719 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 597 transitions. [2025-01-09 03:52:23,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-01-09 03:52:23,724 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:23,724 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:52:23,732 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 03:52:23,924 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:52:23,925 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:23,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:23,926 INFO L85 PathProgramCache]: Analyzing trace with hash 354233284, now seen corresponding path program 1 times [2025-01-09 03:52:23,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:23,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482854325] [2025-01-09 03:52:23,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:23,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:23,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-01-09 03:52:23,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-01-09 03:52:23,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:23,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:24,080 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:52:24,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:24,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482854325] [2025-01-09 03:52:24,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482854325] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:52:24,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [749171869] [2025-01-09 03:52:24,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:24,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:52:24,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:52:24,083 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:52:24,085 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:52:24,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-01-09 03:52:24,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-01-09 03:52:24,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:24,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:24,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 1212 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 03:52:24,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:52:24,390 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-09 03:52:24,394 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:52:24,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [749171869] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:24,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:52:24,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-01-09 03:52:24,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517038950] [2025-01-09 03:52:24,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:24,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:52:24,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:24,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:52:24,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:52:24,396 INFO L87 Difference]: Start difference. First operand 397 states and 597 transitions. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 03:52:24,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:24,462 INFO L93 Difference]: Finished difference Result 783 states and 1183 transitions. [2025-01-09 03:52:24,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:52:24,462 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 152 [2025-01-09 03:52:24,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:24,465 INFO L225 Difference]: With dead ends: 783 [2025-01-09 03:52:24,466 INFO L226 Difference]: Without dead ends: 399 [2025-01-09 03:52:24,467 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:52:24,467 INFO L435 NwaCegarLoop]: 500 mSDtfsCounter, 2 mSDsluCounter, 1483 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1983 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:52:24,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1983 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:52:24,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2025-01-09 03:52:24,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 399. [2025-01-09 03:52:24,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 307 states have (on average 1.521172638436482) internal successors, (467), 312 states have internal predecessors, (467), 65 states have call successors, (65), 24 states have call predecessors, (65), 26 states have return successors, (71), 64 states have call predecessors, (71), 64 states have call successors, (71) [2025-01-09 03:52:24,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 603 transitions. [2025-01-09 03:52:24,487 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 603 transitions. Word has length 152 [2025-01-09 03:52:24,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:24,488 INFO L471 AbstractCegarLoop]: Abstraction has 399 states and 603 transitions. [2025-01-09 03:52:24,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 03:52:24,488 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 603 transitions. [2025-01-09 03:52:24,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 03:52:24,492 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:24,492 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:52:24,500 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:52:24,696 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:52:24,696 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:24,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:24,697 INFO L85 PathProgramCache]: Analyzing trace with hash -5587788, now seen corresponding path program 1 times [2025-01-09 03:52:24,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:24,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944892288] [2025-01-09 03:52:24,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:24,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:24,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 03:52:24,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 03:52:24,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:24,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:24,837 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-01-09 03:52:24,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:24,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944892288] [2025-01-09 03:52:24,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944892288] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:24,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:52:24,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:52:24,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160821398] [2025-01-09 03:52:24,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:24,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:52:24,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:24,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:52:24,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:52:24,840 INFO L87 Difference]: Start difference. First operand 399 states and 603 transitions. Second operand has 5 states, 4 states have (on average 23.25) internal successors, (93), 5 states have internal predecessors, (93), 3 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 03:52:24,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:24,883 INFO L93 Difference]: Finished difference Result 775 states and 1174 transitions. [2025-01-09 03:52:24,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:52:24,883 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 23.25) internal successors, (93), 5 states have internal predecessors, (93), 3 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 153 [2025-01-09 03:52:24,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:24,887 INFO L225 Difference]: With dead ends: 775 [2025-01-09 03:52:24,887 INFO L226 Difference]: Without dead ends: 399 [2025-01-09 03:52:24,889 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:52:24,890 INFO L435 NwaCegarLoop]: 503 mSDtfsCounter, 2 mSDsluCounter, 1498 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2001 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:52:24,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2001 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:52:24,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2025-01-09 03:52:24,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 399. [2025-01-09 03:52:24,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 307 states have (on average 1.521172638436482) internal successors, (467), 312 states have internal predecessors, (467), 65 states have call successors, (65), 24 states have call predecessors, (65), 26 states have return successors, (70), 64 states have call predecessors, (70), 64 states have call successors, (70) [2025-01-09 03:52:24,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 602 transitions. [2025-01-09 03:52:24,912 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 602 transitions. Word has length 153 [2025-01-09 03:52:24,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:24,912 INFO L471 AbstractCegarLoop]: Abstraction has 399 states and 602 transitions. [2025-01-09 03:52:24,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 23.25) internal successors, (93), 5 states have internal predecessors, (93), 3 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 03:52:24,913 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 602 transitions. [2025-01-09 03:52:24,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-01-09 03:52:24,915 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:24,915 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:52:24,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 03:52:24,916 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:24,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:24,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1833345939, now seen corresponding path program 2 times [2025-01-09 03:52:24,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:24,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753955041] [2025-01-09 03:52:24,916 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 03:52:24,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:24,938 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 154 statements into 2 equivalence classes. [2025-01-09 03:52:24,952 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 80 of 154 statements. [2025-01-09 03:52:24,954 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 03:52:24,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:25,122 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-01-09 03:52:25,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:25,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753955041] [2025-01-09 03:52:25,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753955041] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:25,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:52:25,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 03:52:25,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709813589] [2025-01-09 03:52:25,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:25,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:52:25,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:25,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:52:25,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:52:25,126 INFO L87 Difference]: Start difference. First operand 399 states and 602 transitions. Second operand has 8 states, 8 states have (on average 11.875) internal successors, (95), 7 states have internal predecessors, (95), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (19), 4 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 03:52:25,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:25,562 INFO L93 Difference]: Finished difference Result 1071 states and 1597 transitions. [2025-01-09 03:52:25,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 03:52:25,563 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 7 states have internal predecessors, (95), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (19), 4 states have call predecessors, (19), 3 states have call successors, (19) Word has length 154 [2025-01-09 03:52:25,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:25,567 INFO L225 Difference]: With dead ends: 1071 [2025-01-09 03:52:25,568 INFO L226 Difference]: Without dead ends: 885 [2025-01-09 03:52:25,569 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-01-09 03:52:25,569 INFO L435 NwaCegarLoop]: 511 mSDtfsCounter, 608 mSDsluCounter, 2898 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 625 SdHoareTripleChecker+Valid, 3409 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 03:52:25,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [625 Valid, 3409 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 03:52:25,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2025-01-09 03:52:25,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 779. [2025-01-09 03:52:25,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 779 states, 603 states have (on average 1.5306799336650083) internal successors, (923), 610 states have internal predecessors, (923), 124 states have call successors, (124), 48 states have call predecessors, (124), 51 states have return successors, (137), 124 states have call predecessors, (137), 122 states have call successors, (137) [2025-01-09 03:52:25,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 1184 transitions. [2025-01-09 03:52:25,620 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 1184 transitions. Word has length 154 [2025-01-09 03:52:25,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:25,621 INFO L471 AbstractCegarLoop]: Abstraction has 779 states and 1184 transitions. [2025-01-09 03:52:25,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 7 states have internal predecessors, (95), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (19), 4 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 03:52:25,621 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 1184 transitions. [2025-01-09 03:52:25,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 03:52:25,629 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:25,629 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:52:25,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 03:52:25,629 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:25,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:25,633 INFO L85 PathProgramCache]: Analyzing trace with hash 71827861, now seen corresponding path program 1 times [2025-01-09 03:52:25,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:25,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381256663] [2025-01-09 03:52:25,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:25,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:25,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 03:52:25,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 03:52:25,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:25,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:25,908 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-01-09 03:52:25,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:25,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381256663] [2025-01-09 03:52:25,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381256663] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:25,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:52:25,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:52:25,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69349178] [2025-01-09 03:52:25,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:25,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:52:25,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:25,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:52:25,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:52:25,911 INFO L87 Difference]: Start difference. First operand 779 states and 1184 transitions. Second operand has 5 states, 4 states have (on average 24.0) internal successors, (96), 5 states have internal predecessors, (96), 3 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 03:52:25,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:25,964 INFO L93 Difference]: Finished difference Result 1537 states and 2341 transitions. [2025-01-09 03:52:25,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:52:25,965 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 24.0) internal successors, (96), 5 states have internal predecessors, (96), 3 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 155 [2025-01-09 03:52:25,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:25,969 INFO L225 Difference]: With dead ends: 1537 [2025-01-09 03:52:25,969 INFO L226 Difference]: Without dead ends: 781 [2025-01-09 03:52:25,973 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:52:25,973 INFO L435 NwaCegarLoop]: 504 mSDtfsCounter, 1 mSDsluCounter, 1500 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2004 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:52:25,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2004 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:52:25,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2025-01-09 03:52:26,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 781. [2025-01-09 03:52:26,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 781 states, 604 states have (on average 1.5298013245033113) internal successors, (924), 612 states have internal predecessors, (924), 124 states have call successors, (124), 48 states have call predecessors, (124), 52 states have return successors, (139), 124 states have call predecessors, (139), 122 states have call successors, (139) [2025-01-09 03:52:26,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 1187 transitions. [2025-01-09 03:52:26,008 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 1187 transitions. Word has length 155 [2025-01-09 03:52:26,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:26,008 INFO L471 AbstractCegarLoop]: Abstraction has 781 states and 1187 transitions. [2025-01-09 03:52:26,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 24.0) internal successors, (96), 5 states have internal predecessors, (96), 3 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 03:52:26,008 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 1187 transitions. [2025-01-09 03:52:26,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-01-09 03:52:26,011 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:26,011 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:52:26,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 03:52:26,012 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:26,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:26,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1438870745, now seen corresponding path program 1 times [2025-01-09 03:52:26,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:26,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879827347] [2025-01-09 03:52:26,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:26,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:26,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-01-09 03:52:26,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-01-09 03:52:26,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:26,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:26,175 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-01-09 03:52:26,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:26,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879827347] [2025-01-09 03:52:26,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879827347] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:26,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:52:26,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:52:26,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604073693] [2025-01-09 03:52:26,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:26,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:52:26,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:26,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:52:26,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:52:26,178 INFO L87 Difference]: Start difference. First operand 781 states and 1187 transitions. Second operand has 5 states, 4 states have (on average 24.25) internal successors, (97), 5 states have internal predecessors, (97), 3 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 03:52:26,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:26,239 INFO L93 Difference]: Finished difference Result 1539 states and 2344 transitions. [2025-01-09 03:52:26,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:52:26,240 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 24.25) internal successors, (97), 5 states have internal predecessors, (97), 3 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 156 [2025-01-09 03:52:26,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:26,247 INFO L225 Difference]: With dead ends: 1539 [2025-01-09 03:52:26,247 INFO L226 Difference]: Without dead ends: 783 [2025-01-09 03:52:26,249 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:52:26,250 INFO L435 NwaCegarLoop]: 502 mSDtfsCounter, 0 mSDsluCounter, 1495 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1997 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:52:26,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1997 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:52:26,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2025-01-09 03:52:26,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 781. [2025-01-09 03:52:26,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 781 states, 604 states have (on average 1.5298013245033113) internal successors, (924), 612 states have internal predecessors, (924), 124 states have call successors, (124), 48 states have call predecessors, (124), 52 states have return successors, (139), 124 states have call predecessors, (139), 122 states have call successors, (139) [2025-01-09 03:52:26,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 1187 transitions. [2025-01-09 03:52:26,288 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 1187 transitions. Word has length 156 [2025-01-09 03:52:26,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:26,289 INFO L471 AbstractCegarLoop]: Abstraction has 781 states and 1187 transitions. [2025-01-09 03:52:26,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 24.25) internal successors, (97), 5 states have internal predecessors, (97), 3 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 03:52:26,289 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 1187 transitions. [2025-01-09 03:52:26,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-01-09 03:52:26,294 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:26,294 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:52:26,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 03:52:26,294 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:26,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:26,295 INFO L85 PathProgramCache]: Analyzing trace with hash -346235543, now seen corresponding path program 1 times [2025-01-09 03:52:26,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:26,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404010648] [2025-01-09 03:52:26,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:26,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:26,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-01-09 03:52:26,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-01-09 03:52:26,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:26,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:26,445 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:52:26,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:26,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404010648] [2025-01-09 03:52:26,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404010648] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:26,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:52:26,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 03:52:26,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443116463] [2025-01-09 03:52:26,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:26,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:52:26,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:26,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:52:26,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:52:26,447 INFO L87 Difference]: Start difference. First operand 781 states and 1187 transitions. Second operand has 8 states, 7 states have (on average 14.285714285714286) internal successors, (100), 8 states have internal predecessors, (100), 4 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 03:52:26,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:26,560 INFO L93 Difference]: Finished difference Result 1156 states and 1755 transitions. [2025-01-09 03:52:26,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 03:52:26,561 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 14.285714285714286) internal successors, (100), 8 states have internal predecessors, (100), 4 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 156 [2025-01-09 03:52:26,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:26,564 INFO L225 Difference]: With dead ends: 1156 [2025-01-09 03:52:26,564 INFO L226 Difference]: Without dead ends: 403 [2025-01-09 03:52:26,566 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:52:26,567 INFO L435 NwaCegarLoop]: 494 mSDtfsCounter, 7 mSDsluCounter, 2935 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3429 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:52:26,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3429 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:52:26,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2025-01-09 03:52:26,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 403. [2025-01-09 03:52:26,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 310 states have (on average 1.5161290322580645) internal successors, (470), 315 states have internal predecessors, (470), 65 states have call successors, (65), 25 states have call predecessors, (65), 27 states have return successors, (71), 64 states have call predecessors, (71), 64 states have call successors, (71) [2025-01-09 03:52:26,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 606 transitions. [2025-01-09 03:52:26,582 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 606 transitions. Word has length 156 [2025-01-09 03:52:26,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:26,583 INFO L471 AbstractCegarLoop]: Abstraction has 403 states and 606 transitions. [2025-01-09 03:52:26,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 14.285714285714286) internal successors, (100), 8 states have internal predecessors, (100), 4 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 03:52:26,583 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 606 transitions. [2025-01-09 03:52:26,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-01-09 03:52:26,586 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:26,586 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:52:26,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 03:52:26,587 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:26,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:26,587 INFO L85 PathProgramCache]: Analyzing trace with hash -86494897, now seen corresponding path program 1 times [2025-01-09 03:52:26,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:26,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458770689] [2025-01-09 03:52:26,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:26,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:26,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-01-09 03:52:26,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-01-09 03:52:26,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:26,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:26,786 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:52:26,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:26,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458770689] [2025-01-09 03:52:26,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458770689] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:26,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:52:26,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 03:52:26,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506299975] [2025-01-09 03:52:26,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:26,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:52:26,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:26,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:52:26,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:52:26,788 INFO L87 Difference]: Start difference. First operand 403 states and 606 transitions. Second operand has 8 states, 7 states have (on average 14.142857142857142) internal successors, (99), 8 states have internal predecessors, (99), 4 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 03:52:26,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:26,911 INFO L93 Difference]: Finished difference Result 784 states and 1186 transitions. [2025-01-09 03:52:26,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 03:52:26,911 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 14.142857142857142) internal successors, (99), 8 states have internal predecessors, (99), 4 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 156 [2025-01-09 03:52:26,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:26,914 INFO L225 Difference]: With dead ends: 784 [2025-01-09 03:52:26,914 INFO L226 Difference]: Without dead ends: 408 [2025-01-09 03:52:26,916 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:52:26,916 INFO L435 NwaCegarLoop]: 496 mSDtfsCounter, 5 mSDsluCounter, 2947 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 3443 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:52:26,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 3443 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:52:26,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2025-01-09 03:52:26,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 406. [2025-01-09 03:52:26,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 312 states have (on average 1.5128205128205128) internal successors, (472), 318 states have internal predecessors, (472), 65 states have call successors, (65), 25 states have call predecessors, (65), 28 states have return successors, (76), 64 states have call predecessors, (76), 64 states have call successors, (76) [2025-01-09 03:52:26,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 613 transitions. [2025-01-09 03:52:26,931 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 613 transitions. Word has length 156 [2025-01-09 03:52:26,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:26,931 INFO L471 AbstractCegarLoop]: Abstraction has 406 states and 613 transitions. [2025-01-09 03:52:26,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 14.142857142857142) internal successors, (99), 8 states have internal predecessors, (99), 4 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 03:52:26,931 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 613 transitions. [2025-01-09 03:52:26,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-01-09 03:52:26,934 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:26,934 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:52:26,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 03:52:26,934 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:26,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:26,935 INFO L85 PathProgramCache]: Analyzing trace with hash 819754718, now seen corresponding path program 1 times [2025-01-09 03:52:26,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:26,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619510759] [2025-01-09 03:52:26,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:26,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:26,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-01-09 03:52:26,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-01-09 03:52:26,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:26,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:27,104 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-01-09 03:52:27,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:27,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619510759] [2025-01-09 03:52:27,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619510759] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:52:27,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1918901664] [2025-01-09 03:52:27,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:27,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:52:27,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:52:27,111 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:52:27,114 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:52:27,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-01-09 03:52:27,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-01-09 03:52:27,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:27,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:27,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 1217 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:52:27,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:52:27,396 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-01-09 03:52:27,397 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:52:27,478 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-01-09 03:52:27,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1918901664] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:52:27,479 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:52:27,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 11 [2025-01-09 03:52:27,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167090889] [2025-01-09 03:52:27,479 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:52:27,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 03:52:27,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:27,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 03:52:27,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:52:27,481 INFO L87 Difference]: Start difference. First operand 406 states and 613 transitions. Second operand has 11 states, 10 states have (on average 15.4) internal successors, (154), 11 states have internal predecessors, (154), 4 states have call successors, (38), 2 states have call predecessors, (38), 3 states have return successors, (36), 3 states have call predecessors, (36), 4 states have call successors, (36) [2025-01-09 03:52:27,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:27,998 INFO L93 Difference]: Finished difference Result 1129 states and 1788 transitions. [2025-01-09 03:52:27,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 03:52:27,998 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 15.4) internal successors, (154), 11 states have internal predecessors, (154), 4 states have call successors, (38), 2 states have call predecessors, (38), 3 states have return successors, (36), 3 states have call predecessors, (36), 4 states have call successors, (36) Word has length 157 [2025-01-09 03:52:27,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:28,002 INFO L225 Difference]: With dead ends: 1129 [2025-01-09 03:52:28,003 INFO L226 Difference]: Without dead ends: 754 [2025-01-09 03:52:28,004 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 311 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2025-01-09 03:52:28,004 INFO L435 NwaCegarLoop]: 500 mSDtfsCounter, 1360 mSDsluCounter, 2646 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1360 SdHoareTripleChecker+Valid, 3146 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 03:52:28,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1360 Valid, 3146 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 481 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 03:52:28,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2025-01-09 03:52:28,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 730. [2025-01-09 03:52:28,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 730 states, 572 states have (on average 1.5716783216783217) internal successors, (899), 577 states have internal predecessors, (899), 129 states have call successors, (129), 26 states have call predecessors, (129), 28 states have return successors, (150), 128 states have call predecessors, (150), 128 states have call successors, (150) [2025-01-09 03:52:28,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 1178 transitions. [2025-01-09 03:52:28,031 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 1178 transitions. Word has length 157 [2025-01-09 03:52:28,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:28,032 INFO L471 AbstractCegarLoop]: Abstraction has 730 states and 1178 transitions. [2025-01-09 03:52:28,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 15.4) internal successors, (154), 11 states have internal predecessors, (154), 4 states have call successors, (38), 2 states have call predecessors, (38), 3 states have return successors, (36), 3 states have call predecessors, (36), 4 states have call successors, (36) [2025-01-09 03:52:28,032 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 1178 transitions. [2025-01-09 03:52:28,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-01-09 03:52:28,036 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:28,036 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:52:28,046 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:52:28,237 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:52:28,239 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:28,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:28,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1990334565, now seen corresponding path program 1 times [2025-01-09 03:52:28,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:28,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535856824] [2025-01-09 03:52:28,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:28,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:28,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-01-09 03:52:28,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-01-09 03:52:28,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:28,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:28,299 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-01-09 03:52:28,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:28,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535856824] [2025-01-09 03:52:28,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535856824] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:28,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:52:28,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:52:28,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192181890] [2025-01-09 03:52:28,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:28,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:52:28,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:28,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:52:28,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:52:28,302 INFO L87 Difference]: Start difference. First operand 730 states and 1178 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 03:52:28,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:28,340 INFO L93 Difference]: Finished difference Result 1680 states and 2764 transitions. [2025-01-09 03:52:28,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:52:28,341 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 161 [2025-01-09 03:52:28,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:28,348 INFO L225 Difference]: With dead ends: 1680 [2025-01-09 03:52:28,348 INFO L226 Difference]: Without dead ends: 1031 [2025-01-09 03:52:28,350 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:52:28,351 INFO L435 NwaCegarLoop]: 523 mSDtfsCounter, 104 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 1023 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:52:28,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 1023 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:52:28,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1031 states. [2025-01-09 03:52:28,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1031 to 1023. [2025-01-09 03:52:28,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1023 states, 801 states have (on average 1.5942571785268413) internal successors, (1277), 806 states have internal predecessors, (1277), 193 states have call successors, (193), 26 states have call predecessors, (193), 28 states have return successors, (224), 192 states have call predecessors, (224), 192 states have call successors, (224) [2025-01-09 03:52:28,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 1694 transitions. [2025-01-09 03:52:28,402 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 1694 transitions. Word has length 161 [2025-01-09 03:52:28,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:28,402 INFO L471 AbstractCegarLoop]: Abstraction has 1023 states and 1694 transitions. [2025-01-09 03:52:28,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 03:52:28,402 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1694 transitions. [2025-01-09 03:52:28,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-01-09 03:52:28,409 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:28,409 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:52:28,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 03:52:28,410 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:28,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:28,410 INFO L85 PathProgramCache]: Analyzing trace with hash -2140322341, now seen corresponding path program 1 times [2025-01-09 03:52:28,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:28,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448167251] [2025-01-09 03:52:28,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:28,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:28,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-01-09 03:52:28,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-01-09 03:52:28,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:28,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:28,484 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-01-09 03:52:28,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:28,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448167251] [2025-01-09 03:52:28,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448167251] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:28,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:52:28,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:52:28,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037863701] [2025-01-09 03:52:28,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:28,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:52:28,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:28,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:52:28,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:52:28,486 INFO L87 Difference]: Start difference. First operand 1023 states and 1694 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 03:52:28,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:28,536 INFO L93 Difference]: Finished difference Result 2403 states and 4011 transitions. [2025-01-09 03:52:28,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:52:28,537 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 162 [2025-01-09 03:52:28,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:28,544 INFO L225 Difference]: With dead ends: 2403 [2025-01-09 03:52:28,544 INFO L226 Difference]: Without dead ends: 1512 [2025-01-09 03:52:28,547 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:52:28,547 INFO L435 NwaCegarLoop]: 512 mSDtfsCounter, 102 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 1014 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:52:28,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 1014 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:52:28,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-01-09 03:52:28,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1504. [2025-01-09 03:52:28,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1504 states, 1187 states have (on average 1.6065711878685762) internal successors, (1907), 1192 states have internal predecessors, (1907), 288 states have call successors, (288), 26 states have call predecessors, (288), 28 states have return successors, (319), 287 states have call predecessors, (319), 287 states have call successors, (319) [2025-01-09 03:52:28,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1504 states to 1504 states and 2514 transitions. [2025-01-09 03:52:28,654 INFO L78 Accepts]: Start accepts. Automaton has 1504 states and 2514 transitions. Word has length 162 [2025-01-09 03:52:28,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:28,654 INFO L471 AbstractCegarLoop]: Abstraction has 1504 states and 2514 transitions. [2025-01-09 03:52:28,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 03:52:28,654 INFO L276 IsEmpty]: Start isEmpty. Operand 1504 states and 2514 transitions. [2025-01-09 03:52:28,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-01-09 03:52:28,661 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:28,662 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:52:28,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 03:52:28,662 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:28,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:28,663 INFO L85 PathProgramCache]: Analyzing trace with hash -247786857, now seen corresponding path program 1 times [2025-01-09 03:52:28,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:28,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306017098] [2025-01-09 03:52:28,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:28,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:28,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-01-09 03:52:28,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-01-09 03:52:28,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:28,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:28,706 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-01-09 03:52:28,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:28,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306017098] [2025-01-09 03:52:28,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306017098] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:28,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:52:28,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:52:28,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387908687] [2025-01-09 03:52:28,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:28,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:52:28,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:28,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:52:28,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:52:28,708 INFO L87 Difference]: Start difference. First operand 1504 states and 2514 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 03:52:28,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:28,764 INFO L93 Difference]: Finished difference Result 3477 states and 5867 transitions. [2025-01-09 03:52:28,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:52:28,765 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 163 [2025-01-09 03:52:28,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:28,774 INFO L225 Difference]: With dead ends: 3477 [2025-01-09 03:52:28,775 INFO L226 Difference]: Without dead ends: 2236 [2025-01-09 03:52:28,778 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:52:28,779 INFO L435 NwaCegarLoop]: 508 mSDtfsCounter, 100 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 1007 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:52:28,779 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 1007 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:52:28,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2236 states. [2025-01-09 03:52:28,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2236 to 2228. [2025-01-09 03:52:28,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2228 states, 1788 states have (on average 1.616331096196868) internal successors, (2890), 1793 states have internal predecessors, (2890), 411 states have call successors, (411), 26 states have call predecessors, (411), 28 states have return successors, (458), 410 states have call predecessors, (458), 410 states have call successors, (458) [2025-01-09 03:52:28,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2228 states to 2228 states and 3759 transitions. [2025-01-09 03:52:28,858 INFO L78 Accepts]: Start accepts. Automaton has 2228 states and 3759 transitions. Word has length 163 [2025-01-09 03:52:28,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:28,859 INFO L471 AbstractCegarLoop]: Abstraction has 2228 states and 3759 transitions. [2025-01-09 03:52:28,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 03:52:28,859 INFO L276 IsEmpty]: Start isEmpty. Operand 2228 states and 3759 transitions. [2025-01-09 03:52:28,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-01-09 03:52:28,869 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:28,869 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:52:28,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 03:52:28,870 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:28,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:28,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1942858662, now seen corresponding path program 1 times [2025-01-09 03:52:28,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:28,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527026666] [2025-01-09 03:52:28,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:28,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:28,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-01-09 03:52:28,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-09 03:52:28,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:28,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:28,917 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-01-09 03:52:28,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:28,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527026666] [2025-01-09 03:52:28,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527026666] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:28,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:52:28,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:52:28,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773752079] [2025-01-09 03:52:28,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:28,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:52:28,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:28,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:52:28,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:52:28,919 INFO L87 Difference]: Start difference. First operand 2228 states and 3759 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 03:52:29,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:29,044 INFO L93 Difference]: Finished difference Result 5140 states and 8744 transitions. [2025-01-09 03:52:29,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:52:29,045 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 164 [2025-01-09 03:52:29,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:29,061 INFO L225 Difference]: With dead ends: 5140 [2025-01-09 03:52:29,061 INFO L226 Difference]: Without dead ends: 3387 [2025-01-09 03:52:29,067 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:52:29,067 INFO L435 NwaCegarLoop]: 508 mSDtfsCounter, 98 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 1007 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:52:29,068 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 1007 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:52:29,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3387 states. [2025-01-09 03:52:29,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3387 to 3379. [2025-01-09 03:52:29,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3379 states, 2760 states have (on average 1.6228260869565216) internal successors, (4479), 2765 states have internal predecessors, (4479), 590 states have call successors, (590), 26 states have call predecessors, (590), 28 states have return successors, (663), 589 states have call predecessors, (663), 589 states have call successors, (663) [2025-01-09 03:52:29,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3379 states to 3379 states and 5732 transitions. [2025-01-09 03:52:29,240 INFO L78 Accepts]: Start accepts. Automaton has 3379 states and 5732 transitions. Word has length 164 [2025-01-09 03:52:29,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:29,241 INFO L471 AbstractCegarLoop]: Abstraction has 3379 states and 5732 transitions. [2025-01-09 03:52:29,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 03:52:29,241 INFO L276 IsEmpty]: Start isEmpty. Operand 3379 states and 5732 transitions. [2025-01-09 03:52:29,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-01-09 03:52:29,260 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:29,260 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:52:29,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 03:52:29,260 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:29,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:29,261 INFO L85 PathProgramCache]: Analyzing trace with hash -975295397, now seen corresponding path program 1 times [2025-01-09 03:52:29,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:29,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856711930] [2025-01-09 03:52:29,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:29,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:29,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-09 03:52:29,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-09 03:52:29,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:29,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:29,312 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-01-09 03:52:29,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:29,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856711930] [2025-01-09 03:52:29,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856711930] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:29,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:52:29,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:52:29,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620683822] [2025-01-09 03:52:29,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:29,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:52:29,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:29,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:52:29,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:52:29,315 INFO L87 Difference]: Start difference. First operand 3379 states and 5732 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 03:52:29,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:29,434 INFO L93 Difference]: Finished difference Result 8136 states and 13883 transitions. [2025-01-09 03:52:29,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:52:29,435 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 165 [2025-01-09 03:52:29,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:29,458 INFO L225 Difference]: With dead ends: 8136 [2025-01-09 03:52:29,458 INFO L226 Difference]: Without dead ends: 5473 [2025-01-09 03:52:29,524 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:52:29,525 INFO L435 NwaCegarLoop]: 522 mSDtfsCounter, 96 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 1029 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:52:29,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 1029 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:52:29,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5473 states. [2025-01-09 03:52:29,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5473 to 5465. [2025-01-09 03:52:29,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5465 states, 4470 states have (on average 1.6174496644295302) internal successors, (7230), 4475 states have internal predecessors, (7230), 966 states have call successors, (966), 26 states have call predecessors, (966), 28 states have return successors, (1083), 965 states have call predecessors, (1083), 965 states have call successors, (1083) [2025-01-09 03:52:29,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5465 states to 5465 states and 9279 transitions. [2025-01-09 03:52:29,719 INFO L78 Accepts]: Start accepts. Automaton has 5465 states and 9279 transitions. Word has length 165 [2025-01-09 03:52:29,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:29,720 INFO L471 AbstractCegarLoop]: Abstraction has 5465 states and 9279 transitions. [2025-01-09 03:52:29,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 03:52:29,720 INFO L276 IsEmpty]: Start isEmpty. Operand 5465 states and 9279 transitions. [2025-01-09 03:52:29,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-01-09 03:52:29,742 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:29,743 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:52:29,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 03:52:29,743 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:29,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:29,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1511962262, now seen corresponding path program 1 times [2025-01-09 03:52:29,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:29,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271727934] [2025-01-09 03:52:29,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:29,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:29,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-01-09 03:52:29,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-01-09 03:52:29,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:29,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:29,798 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-01-09 03:52:29,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:29,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271727934] [2025-01-09 03:52:29,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271727934] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:29,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:52:29,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:52:29,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381233382] [2025-01-09 03:52:29,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:29,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:52:29,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:29,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:52:29,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:52:29,804 INFO L87 Difference]: Start difference. First operand 5465 states and 9279 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 03:52:30,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:30,038 INFO L93 Difference]: Finished difference Result 13425 states and 22940 transitions. [2025-01-09 03:52:30,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:52:30,038 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 166 [2025-01-09 03:52:30,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:30,077 INFO L225 Difference]: With dead ends: 13425 [2025-01-09 03:52:30,077 INFO L226 Difference]: Without dead ends: 9062 [2025-01-09 03:52:30,092 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:52:30,093 INFO L435 NwaCegarLoop]: 519 mSDtfsCounter, 94 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 1022 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:52:30,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 1022 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:52:30,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9062 states. [2025-01-09 03:52:30,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9062 to 9054. [2025-01-09 03:52:30,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9054 states, 7453 states have (on average 1.6158593854823562) internal successors, (12043), 7458 states have internal predecessors, (12043), 1572 states have call successors, (1572), 26 states have call predecessors, (1572), 28 states have return successors, (1767), 1571 states have call predecessors, (1767), 1571 states have call successors, (1767) [2025-01-09 03:52:30,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9054 states to 9054 states and 15382 transitions. [2025-01-09 03:52:30,446 INFO L78 Accepts]: Start accepts. Automaton has 9054 states and 15382 transitions. Word has length 166 [2025-01-09 03:52:30,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:30,447 INFO L471 AbstractCegarLoop]: Abstraction has 9054 states and 15382 transitions. [2025-01-09 03:52:30,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 03:52:30,448 INFO L276 IsEmpty]: Start isEmpty. Operand 9054 states and 15382 transitions. [2025-01-09 03:52:30,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-01-09 03:52:30,482 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:30,482 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:52:30,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 03:52:30,482 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:30,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:30,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1043493863, now seen corresponding path program 1 times [2025-01-09 03:52:30,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:30,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656956289] [2025-01-09 03:52:30,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:30,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:30,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-01-09 03:52:30,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-01-09 03:52:30,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:30,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:30,535 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-01-09 03:52:30,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:30,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656956289] [2025-01-09 03:52:30,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656956289] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:30,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:52:30,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:52:30,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546296573] [2025-01-09 03:52:30,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:30,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:52:30,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:30,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:52:30,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:52:30,536 INFO L87 Difference]: Start difference. First operand 9054 states and 15382 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 03:52:30,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:30,996 INFO L93 Difference]: Finished difference Result 23371 states and 39862 transitions. [2025-01-09 03:52:30,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:52:30,997 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 167 [2025-01-09 03:52:30,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:31,095 INFO L225 Difference]: With dead ends: 23371 [2025-01-09 03:52:31,096 INFO L226 Difference]: Without dead ends: 15849 [2025-01-09 03:52:31,137 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:52:31,139 INFO L435 NwaCegarLoop]: 521 mSDtfsCounter, 92 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 1026 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:52:31,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 1026 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:52:31,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15849 states. [2025-01-09 03:52:31,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15849 to 15841. [2025-01-09 03:52:31,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15841 states, 13037 states have (on average 1.6067346782235177) internal successors, (20947), 13042 states have internal predecessors, (20947), 2775 states have call successors, (2775), 26 states have call predecessors, (2775), 28 states have return successors, (3114), 2774 states have call predecessors, (3114), 2774 states have call successors, (3114) [2025-01-09 03:52:31,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15841 states to 15841 states and 26836 transitions. [2025-01-09 03:52:31,819 INFO L78 Accepts]: Start accepts. Automaton has 15841 states and 26836 transitions. Word has length 167 [2025-01-09 03:52:31,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:31,820 INFO L471 AbstractCegarLoop]: Abstraction has 15841 states and 26836 transitions. [2025-01-09 03:52:31,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 03:52:31,820 INFO L276 IsEmpty]: Start isEmpty. Operand 15841 states and 26836 transitions. [2025-01-09 03:52:31,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-01-09 03:52:31,858 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:31,858 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:52:31,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 03:52:31,858 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:31,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:31,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1776405131, now seen corresponding path program 1 times [2025-01-09 03:52:31,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:31,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101243750] [2025-01-09 03:52:31,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:31,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:31,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-01-09 03:52:31,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-01-09 03:52:31,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:31,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:31,906 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-01-09 03:52:31,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:31,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101243750] [2025-01-09 03:52:31,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101243750] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:31,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:52:31,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:52:31,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315126570] [2025-01-09 03:52:31,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:31,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:52:31,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:31,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:52:31,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:52:31,908 INFO L87 Difference]: Start difference. First operand 15841 states and 26836 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 03:52:32,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:32,426 INFO L93 Difference]: Finished difference Result 41897 states and 71279 transitions. [2025-01-09 03:52:32,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:52:32,427 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 168 [2025-01-09 03:52:32,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:32,531 INFO L225 Difference]: With dead ends: 41897 [2025-01-09 03:52:32,531 INFO L226 Difference]: Without dead ends: 28201 [2025-01-09 03:52:32,569 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:52:32,570 INFO L435 NwaCegarLoop]: 508 mSDtfsCounter, 90 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1010 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:52:32,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1010 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:52:32,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28201 states. [2025-01-09 03:52:33,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28201 to 28193. [2025-01-09 03:52:33,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28193 states, 23350 states have (on average 1.6021841541755888) internal successors, (37411), 23355 states have internal predecessors, (37411), 4814 states have call successors, (4814), 26 states have call predecessors, (4814), 28 states have return successors, (5427), 4813 states have call predecessors, (5427), 4813 states have call successors, (5427) [2025-01-09 03:52:33,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28193 states to 28193 states and 47652 transitions. [2025-01-09 03:52:33,799 INFO L78 Accepts]: Start accepts. Automaton has 28193 states and 47652 transitions. Word has length 168 [2025-01-09 03:52:33,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:33,799 INFO L471 AbstractCegarLoop]: Abstraction has 28193 states and 47652 transitions. [2025-01-09 03:52:33,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 03:52:33,799 INFO L276 IsEmpty]: Start isEmpty. Operand 28193 states and 47652 transitions. [2025-01-09 03:52:33,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-01-09 03:52:33,861 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:33,861 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:52:33,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 03:52:33,862 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:33,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:33,863 INFO L85 PathProgramCache]: Analyzing trace with hash -695775369, now seen corresponding path program 1 times [2025-01-09 03:52:33,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:33,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044007940] [2025-01-09 03:52:33,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:33,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:33,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-01-09 03:52:33,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-01-09 03:52:33,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:33,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:33,923 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-01-09 03:52:33,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:33,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044007940] [2025-01-09 03:52:33,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044007940] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:33,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:52:33,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:52:33,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562341326] [2025-01-09 03:52:33,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:33,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:52:33,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:33,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:52:33,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:52:33,925 INFO L87 Difference]: Start difference. First operand 28193 states and 47652 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 03:52:35,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:35,406 INFO L93 Difference]: Finished difference Result 76824 states and 130276 transitions. [2025-01-09 03:52:35,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:52:35,407 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 169 [2025-01-09 03:52:35,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:35,600 INFO L225 Difference]: With dead ends: 76824 [2025-01-09 03:52:35,601 INFO L226 Difference]: Without dead ends: 51511 [2025-01-09 03:52:35,661 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:52:35,662 INFO L435 NwaCegarLoop]: 508 mSDtfsCounter, 88 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 1010 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:52:35,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 1010 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:52:35,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51511 states. [2025-01-09 03:52:37,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51511 to 51503. [2025-01-09 03:52:37,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51503 states, 42945 states have (on average 1.59611130515776) internal successors, (68545), 42950 states have internal predecessors, (68545), 8529 states have call successors, (8529), 26 states have call predecessors, (8529), 28 states have return successors, (9674), 8528 states have call predecessors, (9674), 8528 states have call successors, (9674) [2025-01-09 03:52:37,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51503 states to 51503 states and 86748 transitions. [2025-01-09 03:52:37,498 INFO L78 Accepts]: Start accepts. Automaton has 51503 states and 86748 transitions. Word has length 169 [2025-01-09 03:52:37,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:37,498 INFO L471 AbstractCegarLoop]: Abstraction has 51503 states and 86748 transitions. [2025-01-09 03:52:37,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 03:52:37,499 INFO L276 IsEmpty]: Start isEmpty. Operand 51503 states and 86748 transitions. [2025-01-09 03:52:37,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-01-09 03:52:37,589 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:37,589 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:52:37,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 03:52:37,589 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:37,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:37,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1130908843, now seen corresponding path program 1 times [2025-01-09 03:52:37,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:37,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842946545] [2025-01-09 03:52:37,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:37,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:37,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-01-09 03:52:37,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-01-09 03:52:37,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:37,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:37,643 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-01-09 03:52:37,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:37,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842946545] [2025-01-09 03:52:37,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842946545] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:37,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:52:37,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:52:37,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406818373] [2025-01-09 03:52:37,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:37,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:52:37,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:37,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:52:37,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:52:37,644 INFO L87 Difference]: Start difference. First operand 51503 states and 86748 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 03:52:39,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:39,903 INFO L93 Difference]: Finished difference Result 96076 states and 162118 transitions. [2025-01-09 03:52:39,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:52:39,904 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 170 [2025-01-09 03:52:39,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:40,275 INFO L225 Difference]: With dead ends: 96076 [2025-01-09 03:52:40,276 INFO L226 Difference]: Without dead ends: 95882 [2025-01-09 03:52:40,313 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:52:40,316 INFO L435 NwaCegarLoop]: 510 mSDtfsCounter, 83 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 1016 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:52:40,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 1016 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:52:40,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95882 states. [2025-01-09 03:52:43,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95882 to 95874. [2025-01-09 03:52:43,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95874 states, 80517 states have (on average 1.58853409838916) internal successors, (127904), 80522 states have internal predecessors, (127904), 15328 states have call successors, (15328), 26 states have call predecessors, (15328), 28 states have return successors, (17519), 15327 states have call predecessors, (17519), 15327 states have call successors, (17519) [2025-01-09 03:52:43,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95874 states to 95874 states and 160751 transitions. [2025-01-09 03:52:43,938 INFO L78 Accepts]: Start accepts. Automaton has 95874 states and 160751 transitions. Word has length 170 [2025-01-09 03:52:43,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:43,939 INFO L471 AbstractCegarLoop]: Abstraction has 95874 states and 160751 transitions. [2025-01-09 03:52:43,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 03:52:43,940 INFO L276 IsEmpty]: Start isEmpty. Operand 95874 states and 160751 transitions. [2025-01-09 03:52:44,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-01-09 03:52:44,114 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:44,114 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:52:44,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 03:52:44,115 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:44,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:44,115 INFO L85 PathProgramCache]: Analyzing trace with hash 465216792, now seen corresponding path program 1 times [2025-01-09 03:52:44,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:44,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492249360] [2025-01-09 03:52:44,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:44,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:44,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 03:52:44,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 03:52:44,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:44,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:44,599 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-01-09 03:52:44,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:44,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492249360] [2025-01-09 03:52:44,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492249360] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:52:44,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2050546751] [2025-01-09 03:52:44,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:44,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:52:44,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:52:44,602 INFO L229 MonitoredProcess]: Starting monitored process 7 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:52:44,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 03:52:44,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 03:52:44,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 03:52:44,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:44,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:44,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 1256 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-09 03:52:44,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:52:45,102 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-01-09 03:52:45,102 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:52:45,413 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-01-09 03:52:45,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2050546751] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:52:45,413 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:52:45,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 9] total 28 [2025-01-09 03:52:45,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795146944] [2025-01-09 03:52:45,414 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:52:45,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-01-09 03:52:45,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:45,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-01-09 03:52:45,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=688, Unknown=0, NotChecked=0, Total=756 [2025-01-09 03:52:45,415 INFO L87 Difference]: Start difference. First operand 95874 states and 160751 transitions. Second operand has 28 states, 26 states have (on average 10.038461538461538) internal successors, (261), 24 states have internal predecessors, (261), 9 states have call successors, (53), 8 states have call predecessors, (53), 12 states have return successors, (48), 11 states have call predecessors, (48), 9 states have call successors, (48) [2025-01-09 03:52:59,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:59,031 INFO L93 Difference]: Finished difference Result 382444 states and 665168 transitions. [2025-01-09 03:52:59,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2025-01-09 03:52:59,032 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 10.038461538461538) internal successors, (261), 24 states have internal predecessors, (261), 9 states have call successors, (53), 8 states have call predecessors, (53), 12 states have return successors, (48), 11 states have call predecessors, (48), 9 states have call successors, (48) Word has length 171 [2025-01-09 03:52:59,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:53:00,915 INFO L225 Difference]: With dead ends: 382444 [2025-01-09 03:53:00,918 INFO L226 Difference]: Without dead ends: 382258 [2025-01-09 03:53:01,133 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 467 GetRequests, 356 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3482 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1363, Invalid=11293, Unknown=0, NotChecked=0, Total=12656 [2025-01-09 03:53:01,135 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 6431 mSDsluCounter, 4885 mSDsCounter, 0 mSdLazyCounter, 10467 mSolverCounterSat, 1876 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6483 SdHoareTripleChecker+Valid, 5117 SdHoareTripleChecker+Invalid, 12343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1876 IncrementalHoareTripleChecker+Valid, 10467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2025-01-09 03:53:01,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6483 Valid, 5117 Invalid, 12343 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1876 Valid, 10467 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2025-01-09 03:53:01,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382258 states.