./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec11_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_spec11_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 e4fb36b23f327758af91661b12ca1735faf7949901dbd5c1543c17ea0384ceb9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 03:50:11,561 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 03:50:11,626 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:50:11,632 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 03:50:11,633 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 03:50:11,655 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 03:50:11,656 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 03:50:11,656 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 03:50:11,656 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 03:50:11,656 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 03:50:11,657 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 03:50:11,657 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 03:50:11,658 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 03:50:11,658 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 03:50:11,658 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 03:50:11,658 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 03:50:11,658 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 03:50:11,658 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 03:50:11,658 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 03:50:11,658 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 03:50:11,658 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 03:50:11,658 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 03:50:11,658 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 03:50:11,658 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 03:50:11,658 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 03:50:11,658 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 03:50:11,658 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 03:50:11,658 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 03:50:11,658 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 03:50:11,659 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:50:11,659 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:50:11,659 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:50:11,659 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:50:11,659 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 03:50:11,659 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:50:11,659 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:50:11,659 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:50:11,659 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:50:11,659 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 03:50:11,659 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 03:50:11,659 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 03:50:11,659 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 03:50:11,659 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 03:50:11,659 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 03:50:11,659 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 03:50:11,659 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 03:50:11,659 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 03:50:11,659 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 03:50:11,659 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 -> e4fb36b23f327758af91661b12ca1735faf7949901dbd5c1543c17ea0384ceb9 [2025-01-09 03:50:11,873 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 03:50:11,879 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 03:50:11,880 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 03:50:11,881 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 03:50:11,881 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 03:50:11,882 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec11_product30.cil.c [2025-01-09 03:50:12,976 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/40e9c1b2b/f4815ec37f964b10b6192e114c1b4259/FLAGfdc6abd5f [2025-01-09 03:50:13,430 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 03:50:13,430 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec11_product30.cil.c [2025-01-09 03:50:13,451 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/40e9c1b2b/f4815ec37f964b10b6192e114c1b4259/FLAGfdc6abd5f [2025-01-09 03:50:13,558 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/40e9c1b2b/f4815ec37f964b10b6192e114c1b4259 [2025-01-09 03:50:13,560 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 03:50:13,561 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 03:50:13,566 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 03:50:13,566 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 03:50:13,573 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 03:50:13,574 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:50:13" (1/1) ... [2025-01-09 03:50:13,574 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53338b93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:50:13, skipping insertion in model container [2025-01-09 03:50:13,574 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:50:13" (1/1) ... [2025-01-09 03:50:13,623 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 03:50:13,924 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_spec11_product30.cil.c[29507,29520] [2025-01-09 03:50:14,015 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:50:14,032 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 03:50:14,038 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [48] [2025-01-09 03:50:14,039 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [443] [2025-01-09 03:50:14,039 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [668] [2025-01-09 03:50:14,040 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"DecryptAutoResponder_spec.i","") [685] [2025-01-09 03:50:14,040 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [705] [2025-01-09 03:50:14,040 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [1104] [2025-01-09 03:50:14,040 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [1240] [2025-01-09 03:50:14,040 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [1278] [2025-01-09 03:50:14,041 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1560] [2025-01-09 03:50:14,042 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [1569] [2025-01-09 03:50:14,042 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [1935] [2025-01-09 03:50:14,099 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_spec11_product30.cil.c[29507,29520] [2025-01-09 03:50:14,158 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:50:14,205 INFO L204 MainTranslator]: Completed translation [2025-01-09 03:50:14,207 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:50:14 WrapperNode [2025-01-09 03:50:14,208 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 03:50:14,209 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 03:50:14,209 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 03:50:14,209 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 03:50:14,214 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:50:14" (1/1) ... [2025-01-09 03:50:14,245 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:50:14" (1/1) ... [2025-01-09 03:50:14,309 INFO L138 Inliner]: procedures = 131, calls = 203, calls flagged for inlining = 60, calls inlined = 50, statements flattened = 902 [2025-01-09 03:50:14,312 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 03:50:14,312 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 03:50:14,316 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 03:50:14,316 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 03:50:14,326 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:50:14" (1/1) ... [2025-01-09 03:50:14,329 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:50:14" (1/1) ... [2025-01-09 03:50:14,337 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:50:14" (1/1) ... [2025-01-09 03:50:14,381 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:50:14,386 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:50:14" (1/1) ... [2025-01-09 03:50:14,387 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:50:14" (1/1) ... [2025-01-09 03:50:14,410 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:50:14" (1/1) ... [2025-01-09 03:50:14,415 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:50:14" (1/1) ... [2025-01-09 03:50:14,431 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:50:14" (1/1) ... [2025-01-09 03:50:14,441 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:50:14" (1/1) ... [2025-01-09 03:50:14,443 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:50:14" (1/1) ... [2025-01-09 03:50:14,463 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 03:50:14,464 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 03:50:14,464 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 03:50:14,464 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 03:50:14,466 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:50:14" (1/1) ... [2025-01-09 03:50:14,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:50:14,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:50:14,497 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:50:14,502 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:50:14,521 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2025-01-09 03:50:14,521 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2025-01-09 03:50:14,521 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-01-09 03:50:14,521 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-01-09 03:50:14,521 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-01-09 03:50:14,521 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-01-09 03:50:14,522 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-01-09 03:50:14,522 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-01-09 03:50:14,522 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-01-09 03:50:14,522 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-01-09 03:50:14,522 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-01-09 03:50:14,523 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-01-09 03:50:14,523 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-01-09 03:50:14,523 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-01-09 03:50:14,523 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-01-09 03:50:14,523 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-01-09 03:50:14,523 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-01-09 03:50:14,523 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-01-09 03:50:14,523 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-01-09 03:50:14,523 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-01-09 03:50:14,526 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-01-09 03:50:14,526 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-01-09 03:50:14,526 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-01-09 03:50:14,526 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-01-09 03:50:14,526 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 03:50:14,526 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-01-09 03:50:14,526 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-01-09 03:50:14,526 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2025-01-09 03:50:14,526 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2025-01-09 03:50:14,526 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-01-09 03:50:14,527 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-01-09 03:50:14,527 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-01-09 03:50:14,527 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-01-09 03:50:14,527 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-01-09 03:50:14,527 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-01-09 03:50:14,527 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2025-01-09 03:50:14,527 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2025-01-09 03:50:14,527 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-01-09 03:50:14,527 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-01-09 03:50:14,527 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-01-09 03:50:14,527 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-01-09 03:50:14,527 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-01-09 03:50:14,527 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-01-09 03:50:14,527 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-01-09 03:50:14,527 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-01-09 03:50:14,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 03:50:14,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 03:50:14,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 03:50:14,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 03:50:14,528 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-01-09 03:50:14,528 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-01-09 03:50:14,528 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 03:50:14,528 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 03:50:14,699 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 03:50:14,701 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 03:50:15,400 INFO L? ?]: Removed 429 outVars from TransFormulas that were not future-live. [2025-01-09 03:50:15,400 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 03:50:15,421 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 03:50:15,421 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 03:50:15,421 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:50:15 BoogieIcfgContainer [2025-01-09 03:50:15,421 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 03:50:15,422 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 03:50:15,422 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 03:50:15,428 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 03:50:15,428 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:50:13" (1/3) ... [2025-01-09 03:50:15,429 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70e0a433 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:50:15, skipping insertion in model container [2025-01-09 03:50:15,429 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:50:14" (2/3) ... [2025-01-09 03:50:15,429 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70e0a433 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:50:15, skipping insertion in model container [2025-01-09 03:50:15,429 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:50:15" (3/3) ... [2025-01-09 03:50:15,430 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec11_product30.cil.c [2025-01-09 03:50:15,449 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 03:50:15,451 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec11_product30.cil.c that has 24 procedures, 343 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 03:50:15,575 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 03:50:15,594 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;@498079ca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 03:50:15,594 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 03:50:15,601 INFO L276 IsEmpty]: Start isEmpty. Operand has 343 states, 266 states have (on average 1.5150375939849625) internal successors, (403), 270 states have internal predecessors, (403), 52 states have call successors, (52), 23 states have call predecessors, (52), 23 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-01-09 03:50:15,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 03:50:15,622 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:50:15,623 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 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] [2025-01-09 03:50:15,623 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:50:15,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:50:15,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1246521447, now seen corresponding path program 1 times [2025-01-09 03:50:15,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:50:15,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162120645] [2025-01-09 03:50:15,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:50:15,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:50:15,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 03:50:15,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 03:50:15,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:50:15,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:50:16,253 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-09 03:50:16,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:50:16,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162120645] [2025-01-09 03:50:16,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162120645] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:50:16,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [987911406] [2025-01-09 03:50:16,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:50:16,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:50:16,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:50:16,262 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:50:16,270 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:50:16,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 03:50:16,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 03:50:16,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:50:16,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:50:16,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 1177 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 03:50:16,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:50:16,600 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-01-09 03:50:16,600 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:50:16,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [987911406] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:50:16,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:50:16,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2025-01-09 03:50:16,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441796111] [2025-01-09 03:50:16,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:50:16,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 03:50:16,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:50:16,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 03:50:16,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:50:16,622 INFO L87 Difference]: Start difference. First operand has 343 states, 266 states have (on average 1.5150375939849625) internal successors, (403), 270 states have internal predecessors, (403), 52 states have call successors, (52), 23 states have call predecessors, (52), 23 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) Second operand has 2 states, 2 states have (on average 36.5) internal successors, (73), 2 states have internal predecessors, (73), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 03:50:16,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:50:16,654 INFO L93 Difference]: Finished difference Result 533 states and 770 transitions. [2025-01-09 03:50:16,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 03:50:16,655 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 36.5) internal successors, (73), 2 states have internal predecessors, (73), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 139 [2025-01-09 03:50:16,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:50:16,663 INFO L225 Difference]: With dead ends: 533 [2025-01-09 03:50:16,663 INFO L226 Difference]: Without dead ends: 336 [2025-01-09 03:50:16,666 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 140 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:50:16,668 INFO L435 NwaCegarLoop]: 504 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:50:16,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 504 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:50:16,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2025-01-09 03:50:16,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 336. [2025-01-09 03:50:16,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 260 states have (on average 1.5115384615384615) internal successors, (393), 263 states have internal predecessors, (393), 52 states have call successors, (52), 23 states have call predecessors, (52), 23 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-01-09 03:50:16,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 496 transitions. [2025-01-09 03:50:16,710 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 496 transitions. Word has length 139 [2025-01-09 03:50:16,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:50:16,711 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 496 transitions. [2025-01-09 03:50:16,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 36.5) internal successors, (73), 2 states have internal predecessors, (73), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 03:50:16,711 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 496 transitions. [2025-01-09 03:50:16,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 03:50:16,714 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:50:16,714 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 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] [2025-01-09 03:50:16,723 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:50:16,915 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:50:16,915 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:50:16,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:50:16,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1723689971, now seen corresponding path program 1 times [2025-01-09 03:50:16,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:50:16,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035305987] [2025-01-09 03:50:16,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:50:16,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:50:16,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 03:50:17,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 03:50:17,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:50:17,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:50:17,252 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-09 03:50:17,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:50:17,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035305987] [2025-01-09 03:50:17,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035305987] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:50:17,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [123435994] [2025-01-09 03:50:17,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:50:17,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:50:17,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:50:17,256 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:50:17,257 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:50:17,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 03:50:17,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 03:50:17,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:50:17,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:50:17,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 1177 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 03:50:17,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:50:17,546 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-01-09 03:50:17,546 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:50:17,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [123435994] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:50:17,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:50:17,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 03:50:17,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421432907] [2025-01-09 03:50:17,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:50:17,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:50:17,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:50:17,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:50:17,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:50:17,548 INFO L87 Difference]: Start difference. First operand 336 states and 496 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 03:50:17,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:50:17,578 INFO L93 Difference]: Finished difference Result 522 states and 751 transitions. [2025-01-09 03:50:17,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:50:17,579 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 139 [2025-01-09 03:50:17,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:50:17,581 INFO L225 Difference]: With dead ends: 522 [2025-01-09 03:50:17,581 INFO L226 Difference]: Without dead ends: 338 [2025-01-09 03:50:17,582 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 139 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:50:17,583 INFO L435 NwaCegarLoop]: 494 mSDtfsCounter, 1 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 986 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:50:17,583 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 986 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:50:17,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2025-01-09 03:50:17,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 337. [2025-01-09 03:50:17,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 261 states have (on average 1.5095785440613028) internal successors, (394), 264 states have internal predecessors, (394), 52 states have call successors, (52), 23 states have call predecessors, (52), 23 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-01-09 03:50:17,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 497 transitions. [2025-01-09 03:50:17,601 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 497 transitions. Word has length 139 [2025-01-09 03:50:17,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:50:17,601 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 497 transitions. [2025-01-09 03:50:17,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 03:50:17,601 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 497 transitions. [2025-01-09 03:50:17,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-01-09 03:50:17,603 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:50:17,604 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 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] [2025-01-09 03:50:17,614 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 03:50:17,804 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:50:17,805 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:50:17,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:50:17,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1494591552, now seen corresponding path program 1 times [2025-01-09 03:50:17,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:50:17,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774899755] [2025-01-09 03:50:17,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:50:17,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:50:17,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 03:50:17,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 03:50:17,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:50:17,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:50:18,003 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-01-09 03:50:18,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:50:18,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774899755] [2025-01-09 03:50:18,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774899755] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:50:18,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [907687781] [2025-01-09 03:50:18,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:50:18,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:50:18,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:50:18,006 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:50:18,008 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:50:18,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 03:50:18,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 03:50:18,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:50:18,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:50:18,269 INFO L256 TraceCheckSpWp]: Trace formula consists of 1201 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:50:18,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:50:18,287 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-01-09 03:50:18,287 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:50:18,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [907687781] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:50:18,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:50:18,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 03:50:18,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897008309] [2025-01-09 03:50:18,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:50:18,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:50:18,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:50:18,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:50:18,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:50:18,289 INFO L87 Difference]: Start difference. First operand 337 states and 497 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 03:50:18,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:50:18,313 INFO L93 Difference]: Finished difference Result 704 states and 1053 transitions. [2025-01-09 03:50:18,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:50:18,314 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 147 [2025-01-09 03:50:18,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:50:18,317 INFO L225 Difference]: With dead ends: 704 [2025-01-09 03:50:18,317 INFO L226 Difference]: Without dead ends: 393 [2025-01-09 03:50:18,318 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 147 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:50:18,319 INFO L435 NwaCegarLoop]: 507 mSDtfsCounter, 107 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 957 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:50:18,319 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 957 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:50:18,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2025-01-09 03:50:18,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 385. [2025-01-09 03:50:18,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 298 states have (on average 1.5268456375838926) internal successors, (455), 301 states have internal predecessors, (455), 63 states have call successors, (63), 23 states have call predecessors, (63), 23 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2025-01-09 03:50:18,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 580 transitions. [2025-01-09 03:50:18,337 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 580 transitions. Word has length 147 [2025-01-09 03:50:18,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:50:18,337 INFO L471 AbstractCegarLoop]: Abstraction has 385 states and 580 transitions. [2025-01-09 03:50:18,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 03:50:18,338 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 580 transitions. [2025-01-09 03:50:18,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-01-09 03:50:18,339 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:50:18,340 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 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] [2025-01-09 03:50:18,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 03:50:18,540 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:50:18,540 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:50:18,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:50:18,541 INFO L85 PathProgramCache]: Analyzing trace with hash -724104233, now seen corresponding path program 1 times [2025-01-09 03:50:18,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:50:18,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740055537] [2025-01-09 03:50:18,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:50:18,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:50:18,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-01-09 03:50:18,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-01-09 03:50:18,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:50:18,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:50:18,726 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-01-09 03:50:18,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:50:18,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740055537] [2025-01-09 03:50:18,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740055537] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:50:18,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1739226979] [2025-01-09 03:50:18,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:50:18,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:50:18,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:50:18,732 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:50:18,734 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:50:18,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-01-09 03:50:18,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-01-09 03:50:18,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:50:18,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:50:18,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 1206 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 03:50:19,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:50:19,071 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-01-09 03:50:19,071 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:50:19,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1739226979] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:50:19,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:50:19,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-01-09 03:50:19,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139953378] [2025-01-09 03:50:19,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:50:19,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:50:19,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:50:19,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:50:19,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:50:19,076 INFO L87 Difference]: Start difference. First operand 385 states and 580 transitions. Second operand has 5 states, 4 states have (on average 22.75) internal successors, (91), 5 states have internal predecessors, (91), 3 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-01-09 03:50:19,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:50:19,129 INFO L93 Difference]: Finished difference Result 761 states and 1150 transitions. [2025-01-09 03:50:19,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:50:19,130 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 22.75) internal successors, (91), 5 states have internal predecessors, (91), 3 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) Word has length 148 [2025-01-09 03:50:19,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:50:19,132 INFO L225 Difference]: With dead ends: 761 [2025-01-09 03:50:19,133 INFO L226 Difference]: Without dead ends: 387 [2025-01-09 03:50:19,134 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 146 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:50:19,134 INFO L435 NwaCegarLoop]: 488 mSDtfsCounter, 2 mSDsluCounter, 1453 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1941 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:50:19,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1941 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:50:19,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2025-01-09 03:50:19,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 387. [2025-01-09 03:50:19,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 299 states have (on average 1.5250836120401339) internal successors, (456), 303 states have internal predecessors, (456), 63 states have call successors, (63), 23 states have call predecessors, (63), 24 states have return successors, (64), 62 states have call predecessors, (64), 62 states have call successors, (64) [2025-01-09 03:50:19,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 583 transitions. [2025-01-09 03:50:19,152 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 583 transitions. Word has length 148 [2025-01-09 03:50:19,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:50:19,152 INFO L471 AbstractCegarLoop]: Abstraction has 387 states and 583 transitions. [2025-01-09 03:50:19,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 22.75) internal successors, (91), 5 states have internal predecessors, (91), 3 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-01-09 03:50:19,158 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 583 transitions. [2025-01-09 03:50:19,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-01-09 03:50:19,161 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:50:19,161 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 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] [2025-01-09 03:50:19,169 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:50:19,361 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:50:19,362 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:50:19,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:50:19,362 INFO L85 PathProgramCache]: Analyzing trace with hash 490882336, now seen corresponding path program 1 times [2025-01-09 03:50:19,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:50:19,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252851769] [2025-01-09 03:50:19,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:50:19,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:50:19,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 03:50:19,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 03:50:19,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:50:19,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:50:19,519 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-01-09 03:50:19,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:50:19,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252851769] [2025-01-09 03:50:19,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252851769] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:50:19,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [998100697] [2025-01-09 03:50:19,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:50:19,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:50:19,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:50:19,526 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:50:19,529 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:50:19,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 03:50:19,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 03:50:19,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:50:19,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:50:19,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 1207 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 03:50:19,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:50:19,806 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-01-09 03:50:19,806 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:50:19,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [998100697] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:50:19,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:50:19,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-01-09 03:50:19,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059730441] [2025-01-09 03:50:19,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:50:19,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:50:19,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:50:19,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:50:19,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:50:19,808 INFO L87 Difference]: Start difference. First operand 387 states and 583 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 3 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-01-09 03:50:19,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:50:19,861 INFO L93 Difference]: Finished difference Result 763 states and 1155 transitions. [2025-01-09 03:50:19,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:50:19,862 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 3 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 149 [2025-01-09 03:50:19,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:50:19,865 INFO L225 Difference]: With dead ends: 763 [2025-01-09 03:50:19,866 INFO L226 Difference]: Without dead ends: 389 [2025-01-09 03:50:19,867 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 147 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:50:19,867 INFO L435 NwaCegarLoop]: 486 mSDtfsCounter, 2 mSDsluCounter, 1441 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1927 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:50:19,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1927 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:50:19,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2025-01-09 03:50:19,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 389. [2025-01-09 03:50:19,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 300 states have (on average 1.5233333333333334) internal successors, (457), 305 states have internal predecessors, (457), 63 states have call successors, (63), 23 states have call predecessors, (63), 25 states have return successors, (69), 62 states have call predecessors, (69), 62 states have call successors, (69) [2025-01-09 03:50:19,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 589 transitions. [2025-01-09 03:50:19,884 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 589 transitions. Word has length 149 [2025-01-09 03:50:19,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:50:19,885 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 589 transitions. [2025-01-09 03:50:19,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 3 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-01-09 03:50:19,885 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 589 transitions. [2025-01-09 03:50:19,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-01-09 03:50:19,887 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:50:19,887 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, 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:50:19,899 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 03:50:20,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:50:20,092 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:50:20,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:50:20,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1651242588, now seen corresponding path program 1 times [2025-01-09 03:50:20,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:50:20,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545697317] [2025-01-09 03:50:20,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:50:20,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:50:20,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-09 03:50:20,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-09 03:50:20,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:50:20,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:50:20,215 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-01-09 03:50:20,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:50:20,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545697317] [2025-01-09 03:50:20,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545697317] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:50:20,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:50:20,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:50:20,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489528097] [2025-01-09 03:50:20,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:50:20,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:50:20,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:50:20,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:50:20,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:50:20,218 INFO L87 Difference]: Start difference. First operand 389 states and 589 transitions. Second operand has 5 states, 4 states have (on average 22.25) internal successors, (89), 5 states have internal predecessors, (89), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-01-09 03:50:20,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:50:20,258 INFO L93 Difference]: Finished difference Result 755 states and 1146 transitions. [2025-01-09 03:50:20,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:50:20,259 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 22.25) internal successors, (89), 5 states have internal predecessors, (89), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) Word has length 150 [2025-01-09 03:50:20,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:50:20,262 INFO L225 Difference]: With dead ends: 755 [2025-01-09 03:50:20,263 INFO L226 Difference]: Without dead ends: 389 [2025-01-09 03:50:20,264 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:50:20,266 INFO L435 NwaCegarLoop]: 489 mSDtfsCounter, 2 mSDsluCounter, 1456 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1945 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:50:20,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1945 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:50:20,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2025-01-09 03:50:20,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 389. [2025-01-09 03:50:20,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 300 states have (on average 1.5233333333333334) internal successors, (457), 305 states have internal predecessors, (457), 63 states have call successors, (63), 23 states have call predecessors, (63), 25 states have return successors, (68), 62 states have call predecessors, (68), 62 states have call successors, (68) [2025-01-09 03:50:20,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 588 transitions. [2025-01-09 03:50:20,293 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 588 transitions. Word has length 150 [2025-01-09 03:50:20,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:50:20,293 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 588 transitions. [2025-01-09 03:50:20,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 22.25) internal successors, (89), 5 states have internal predecessors, (89), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-01-09 03:50:20,295 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 588 transitions. [2025-01-09 03:50:20,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-01-09 03:50:20,296 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:50:20,297 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, 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] [2025-01-09 03:50:20,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 03:50:20,297 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:50:20,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:50:20,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1743728761, now seen corresponding path program 2 times [2025-01-09 03:50:20,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:50:20,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422931326] [2025-01-09 03:50:20,298 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 03:50:20,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:50:20,334 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 151 statements into 2 equivalence classes. [2025-01-09 03:50:20,342 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 58 of 151 statements. [2025-01-09 03:50:20,342 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 03:50:20,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:50:20,476 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-09 03:50:20,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:50:20,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422931326] [2025-01-09 03:50:20,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422931326] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:50:20,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:50:20,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 03:50:20,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631276057] [2025-01-09 03:50:20,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:50:20,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:50:20,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:50:20,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:50:20,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:50:20,478 INFO L87 Difference]: Start difference. First operand 389 states and 588 transitions. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 7 states have internal predecessors, (91), 3 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) [2025-01-09 03:50:20,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:50:20,813 INFO L93 Difference]: Finished difference Result 1047 states and 1563 transitions. [2025-01-09 03:50:20,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 03:50:20,814 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 7 states have internal predecessors, (91), 3 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) Word has length 151 [2025-01-09 03:50:20,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:50:20,819 INFO L225 Difference]: With dead ends: 1047 [2025-01-09 03:50:20,819 INFO L226 Difference]: Without dead ends: 869 [2025-01-09 03:50:20,820 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-01-09 03:50:20,821 INFO L435 NwaCegarLoop]: 536 mSDtfsCounter, 578 mSDsluCounter, 3032 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 594 SdHoareTripleChecker+Valid, 3568 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 03:50:20,821 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [594 Valid, 3568 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 03:50:20,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2025-01-09 03:50:20,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 773. [2025-01-09 03:50:20,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 773 states, 598 states have (on average 1.528428093645485) internal successors, (914), 605 states have internal predecessors, (914), 124 states have call successors, (124), 47 states have call predecessors, (124), 50 states have return successors, (138), 124 states have call predecessors, (138), 122 states have call successors, (138) [2025-01-09 03:50:20,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 1176 transitions. [2025-01-09 03:50:20,868 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 1176 transitions. Word has length 151 [2025-01-09 03:50:20,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:50:20,869 INFO L471 AbstractCegarLoop]: Abstraction has 773 states and 1176 transitions. [2025-01-09 03:50:20,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 7 states have internal predecessors, (91), 3 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) [2025-01-09 03:50:20,869 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 1176 transitions. [2025-01-09 03:50:20,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-01-09 03:50:20,873 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:50:20,873 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, 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] [2025-01-09 03:50:20,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 03:50:20,873 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:50:20,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:50:20,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1697521395, now seen corresponding path program 1 times [2025-01-09 03:50:20,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:50:20,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481640612] [2025-01-09 03:50:20,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:50:20,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:50:20,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-01-09 03:50:20,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-01-09 03:50:20,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:50:20,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:50:20,998 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-01-09 03:50:20,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:50:20,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481640612] [2025-01-09 03:50:20,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481640612] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:50:20,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:50:20,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:50:20,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216847258] [2025-01-09 03:50:20,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:50:20,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:50:20,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:50:21,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:50:21,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:50:21,000 INFO L87 Difference]: Start difference. First operand 773 states and 1176 transitions. Second operand has 5 states, 4 states have (on average 23.0) internal successors, (92), 5 states have internal predecessors, (92), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-01-09 03:50:21,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:50:21,048 INFO L93 Difference]: Finished difference Result 1515 states and 2312 transitions. [2025-01-09 03:50:21,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:50:21,049 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 23.0) internal successors, (92), 5 states have internal predecessors, (92), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) Word has length 152 [2025-01-09 03:50:21,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:50:21,053 INFO L225 Difference]: With dead ends: 1515 [2025-01-09 03:50:21,053 INFO L226 Difference]: Without dead ends: 777 [2025-01-09 03:50:21,054 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:50:21,055 INFO L435 NwaCegarLoop]: 490 mSDtfsCounter, 1 mSDsluCounter, 1458 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1948 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:50:21,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1948 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:50:21,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777 states. [2025-01-09 03:50:21,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777 to 777. [2025-01-09 03:50:21,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 777 states, 600 states have (on average 1.5266666666666666) internal successors, (916), 609 states have internal predecessors, (916), 124 states have call successors, (124), 47 states have call predecessors, (124), 52 states have return successors, (141), 124 states have call predecessors, (141), 122 states have call successors, (141) [2025-01-09 03:50:21,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 1181 transitions. [2025-01-09 03:50:21,111 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 1181 transitions. Word has length 152 [2025-01-09 03:50:21,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:50:21,111 INFO L471 AbstractCegarLoop]: Abstraction has 777 states and 1181 transitions. [2025-01-09 03:50:21,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 23.0) internal successors, (92), 5 states have internal predecessors, (92), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-01-09 03:50:21,111 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 1181 transitions. [2025-01-09 03:50:21,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 03:50:21,114 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:50:21,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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:50:21,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 03:50:21,115 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:50:21,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:50:21,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1147676899, now seen corresponding path program 1 times [2025-01-09 03:50:21,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:50:21,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488854246] [2025-01-09 03:50:21,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:50:21,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:50:21,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 03:50:21,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 03:50:21,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:50:21,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:50:21,236 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-01-09 03:50:21,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:50:21,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488854246] [2025-01-09 03:50:21,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488854246] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:50:21,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:50:21,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 03:50:21,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012198518] [2025-01-09 03:50:21,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:50:21,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:50:21,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:50:21,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:50:21,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:50:21,237 INFO L87 Difference]: Start difference. First operand 777 states and 1181 transitions. Second operand has 8 states, 7 states have (on average 13.714285714285714) internal successors, (96), 8 states have internal predecessors, (96), 4 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2025-01-09 03:50:21,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:50:21,348 INFO L93 Difference]: Finished difference Result 1514 states and 2305 transitions. [2025-01-09 03:50:21,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 03:50:21,349 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 13.714285714285714) internal successors, (96), 8 states have internal predecessors, (96), 4 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) Word has length 153 [2025-01-09 03:50:21,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:50:21,353 INFO L225 Difference]: With dead ends: 1514 [2025-01-09 03:50:21,353 INFO L226 Difference]: Without dead ends: 781 [2025-01-09 03:50:21,355 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:50:21,356 INFO L435 NwaCegarLoop]: 480 mSDtfsCounter, 7 mSDsluCounter, 2851 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3331 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:50:21,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3331 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:50:21,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2025-01-09 03:50:21,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 779. [2025-01-09 03:50:21,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 779 states, 602 states have (on average 1.5249169435215948) internal successors, (918), 610 states have internal predecessors, (918), 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:50:21,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 1181 transitions. [2025-01-09 03:50:21,389 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 1181 transitions. Word has length 153 [2025-01-09 03:50:21,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:50:21,390 INFO L471 AbstractCegarLoop]: Abstraction has 779 states and 1181 transitions. [2025-01-09 03:50:21,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 13.714285714285714) internal successors, (96), 8 states have internal predecessors, (96), 4 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2025-01-09 03:50:21,390 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 1181 transitions. [2025-01-09 03:50:21,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-01-09 03:50:21,394 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:50:21,394 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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:50:21,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 03:50:21,394 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:50:21,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:50:21,395 INFO L85 PathProgramCache]: Analyzing trace with hash 274778597, now seen corresponding path program 2 times [2025-01-09 03:50:21,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:50:21,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764038708] [2025-01-09 03:50:21,395 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 03:50:21,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:50:21,414 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 154 statements into 2 equivalence classes. [2025-01-09 03:50:21,423 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 61 of 154 statements. [2025-01-09 03:50:21,424 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 03:50:21,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:50:21,519 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-09 03:50:21,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:50:21,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764038708] [2025-01-09 03:50:21,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764038708] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:50:21,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:50:21,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 03:50:21,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832459157] [2025-01-09 03:50:21,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:50:21,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:50:21,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:50:21,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:50:21,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:50:21,520 INFO L87 Difference]: Start difference. First operand 779 states and 1181 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, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) [2025-01-09 03:50:21,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:50:21,936 INFO L93 Difference]: Finished difference Result 2075 states and 3115 transitions. [2025-01-09 03:50:21,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 03:50:21,937 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, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) Word has length 154 [2025-01-09 03:50:21,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:50:21,944 INFO L225 Difference]: With dead ends: 2075 [2025-01-09 03:50:21,944 INFO L226 Difference]: Without dead ends: 1721 [2025-01-09 03:50:21,946 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 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:50:21,946 INFO L435 NwaCegarLoop]: 521 mSDtfsCounter, 558 mSDsluCounter, 2900 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 572 SdHoareTripleChecker+Valid, 3421 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 03:50:21,946 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [572 Valid, 3421 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 03:50:21,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1721 states. [2025-01-09 03:50:22,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1721 to 1529. [2025-01-09 03:50:22,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1529 states, 1185 states have (on average 1.5316455696202531) internal successors, (1815), 1202 states have internal predecessors, (1815), 238 states have call successors, (238), 94 states have call predecessors, (238), 105 states have return successors, (290), 240 states have call predecessors, (290), 234 states have call successors, (290) [2025-01-09 03:50:22,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1529 states to 1529 states and 2343 transitions. [2025-01-09 03:50:22,019 INFO L78 Accepts]: Start accepts. Automaton has 1529 states and 2343 transitions. Word has length 154 [2025-01-09 03:50:22,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:50:22,019 INFO L471 AbstractCegarLoop]: Abstraction has 1529 states and 2343 transitions. [2025-01-09 03:50:22,020 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, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) [2025-01-09 03:50:22,020 INFO L276 IsEmpty]: Start isEmpty. Operand 1529 states and 2343 transitions. [2025-01-09 03:50:22,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-01-09 03:50:22,025 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:50:22,026 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 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] [2025-01-09 03:50:22,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 03:50:22,026 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:50:22,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:50:22,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1455873647, now seen corresponding path program 1 times [2025-01-09 03:50:22,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:50:22,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963431240] [2025-01-09 03:50:22,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:50:22,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:50:22,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 03:50:22,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 03:50:22,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:50:22,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:50:22,125 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-01-09 03:50:22,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:50:22,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963431240] [2025-01-09 03:50:22,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963431240] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:50:22,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [148745816] [2025-01-09 03:50:22,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:50:22,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:50:22,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:50:22,128 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:50:22,129 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:50:22,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 03:50:22,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 03:50:22,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:50:22,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:50:22,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 1212 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 03:50:22,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:50:22,408 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-01-09 03:50:22,412 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:50:22,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [148745816] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:50:22,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:50:22,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-01-09 03:50:22,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467655429] [2025-01-09 03:50:22,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:50:22,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:50:22,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:50:22,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:50:22,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:50:22,416 INFO L87 Difference]: Start difference. First operand 1529 states and 2343 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 03:50:22,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:50:22,496 INFO L93 Difference]: Finished difference Result 2311 states and 3533 transitions. [2025-01-09 03:50:22,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:50:22,496 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 154 [2025-01-09 03:50:22,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:50:22,504 INFO L225 Difference]: With dead ends: 2311 [2025-01-09 03:50:22,504 INFO L226 Difference]: Without dead ends: 1543 [2025-01-09 03:50:22,507 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 152 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:50:22,507 INFO L435 NwaCegarLoop]: 489 mSDtfsCounter, 1 mSDsluCounter, 1449 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1938 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:50:22,508 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1938 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:50:22,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1543 states. [2025-01-09 03:50:22,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1543 to 1531. [2025-01-09 03:50:22,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1531 states, 1186 states have (on average 1.5311973018549747) internal successors, (1816), 1204 states have internal predecessors, (1816), 238 states have call successors, (238), 94 states have call predecessors, (238), 106 states have return successors, (292), 240 states have call predecessors, (292), 234 states have call successors, (292) [2025-01-09 03:50:22,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1531 states to 1531 states and 2346 transitions. [2025-01-09 03:50:22,567 INFO L78 Accepts]: Start accepts. Automaton has 1531 states and 2346 transitions. Word has length 154 [2025-01-09 03:50:22,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:50:22,567 INFO L471 AbstractCegarLoop]: Abstraction has 1531 states and 2346 transitions. [2025-01-09 03:50:22,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 03:50:22,567 INFO L276 IsEmpty]: Start isEmpty. Operand 1531 states and 2346 transitions. [2025-01-09 03:50:22,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 03:50:22,572 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:50:22,572 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:50:22,580 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-09 03:50:22,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-01-09 03:50:22,773 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:50:22,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:50:22,774 INFO L85 PathProgramCache]: Analyzing trace with hash -838705048, now seen corresponding path program 1 times [2025-01-09 03:50:22,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:50:22,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967081874] [2025-01-09 03:50:22,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:50:22,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:50:22,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 03:50:22,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 03:50:22,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:50:22,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:50:22,932 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-01-09 03:50:22,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:50:22,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967081874] [2025-01-09 03:50:22,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967081874] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:50:22,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1245022745] [2025-01-09 03:50:22,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:50:22,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:50:22,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:50:22,935 INFO L229 MonitoredProcess]: Starting monitored process 8 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:50:22,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 03:50:23,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 03:50:23,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 03:50:23,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:50:23,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:50:23,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 1213 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:50:23,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:50:23,225 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-01-09 03:50:23,226 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:50:23,312 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-01-09 03:50:23,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1245022745] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:50:23,313 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:50:23,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 11 [2025-01-09 03:50:23,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132005571] [2025-01-09 03:50:23,313 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:50:23,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 03:50:23,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:50:23,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 03:50:23,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:50:23,314 INFO L87 Difference]: Start difference. First operand 1531 states and 2346 transitions. Second operand has 11 states, 10 states have (on average 14.8) internal successors, (148), 11 states have internal predecessors, (148), 4 states have call successors, (34), 2 states have call predecessors, (34), 3 states have return successors, (32), 3 states have call predecessors, (32), 4 states have call successors, (32) [2025-01-09 03:50:23,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:50:23,822 INFO L93 Difference]: Finished difference Result 4395 states and 7072 transitions. [2025-01-09 03:50:23,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 03:50:23,823 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 14.8) internal successors, (148), 11 states have internal predecessors, (148), 4 states have call successors, (34), 2 states have call predecessors, (34), 3 states have return successors, (32), 3 states have call predecessors, (32), 4 states have call successors, (32) Word has length 155 [2025-01-09 03:50:23,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:50:23,836 INFO L225 Difference]: With dead ends: 4395 [2025-01-09 03:50:23,836 INFO L226 Difference]: Without dead ends: 2919 [2025-01-09 03:50:23,841 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 307 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:50:23,842 INFO L435 NwaCegarLoop]: 482 mSDtfsCounter, 1223 mSDsluCounter, 2934 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1223 SdHoareTripleChecker+Valid, 3416 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 03:50:23,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1223 Valid, 3416 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 03:50:23,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2919 states. [2025-01-09 03:50:23,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2919 to 2819. [2025-01-09 03:50:23,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2819 states, 2218 states have (on average 1.5852119026149685) internal successors, (3516), 2236 states have internal predecessors, (3516), 494 states have call successors, (494), 94 states have call predecessors, (494), 106 states have return successors, (628), 496 states have call predecessors, (628), 490 states have call successors, (628) [2025-01-09 03:50:23,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2819 states to 2819 states and 4638 transitions. [2025-01-09 03:50:23,991 INFO L78 Accepts]: Start accepts. Automaton has 2819 states and 4638 transitions. Word has length 155 [2025-01-09 03:50:23,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:50:23,991 INFO L471 AbstractCegarLoop]: Abstraction has 2819 states and 4638 transitions. [2025-01-09 03:50:23,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 14.8) internal successors, (148), 11 states have internal predecessors, (148), 4 states have call successors, (34), 2 states have call predecessors, (34), 3 states have return successors, (32), 3 states have call predecessors, (32), 4 states have call successors, (32) [2025-01-09 03:50:23,992 INFO L276 IsEmpty]: Start isEmpty. Operand 2819 states and 4638 transitions. [2025-01-09 03:50:24,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-01-09 03:50:24,006 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:50:24,006 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, 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:50:24,020 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-09 03:50:24,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:50:24,207 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:50:24,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:50:24,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1652837551, now seen corresponding path program 1 times [2025-01-09 03:50:24,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:50:24,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031527177] [2025-01-09 03:50:24,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:50:24,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:50:24,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-01-09 03:50:24,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-01-09 03:50:24,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:50:24,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:50:24,252 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-01-09 03:50:24,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:50:24,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031527177] [2025-01-09 03:50:24,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031527177] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:50:24,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:50:24,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:50:24,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373801350] [2025-01-09 03:50:24,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:50:24,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:50:24,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:50:24,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:50:24,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:50:24,254 INFO L87 Difference]: Start difference. First operand 2819 states and 4638 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 03:50:24,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:50:24,354 INFO L93 Difference]: Finished difference Result 6601 states and 11058 transitions. [2025-01-09 03:50:24,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:50:24,355 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 159 [2025-01-09 03:50:24,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:50:24,373 INFO L225 Difference]: With dead ends: 6601 [2025-01-09 03:50:24,374 INFO L226 Difference]: Without dead ends: 4023 [2025-01-09 03:50:24,383 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:50:24,384 INFO L435 NwaCegarLoop]: 506 mSDtfsCounter, 104 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 991 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:50:24,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 991 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:50:24,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4023 states. [2025-01-09 03:50:24,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4023 to 3991. [2025-01-09 03:50:24,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3991 states, 3134 states have (on average 1.6043395022335674) internal successors, (5028), 3152 states have internal predecessors, (5028), 750 states have call successors, (750), 94 states have call predecessors, (750), 106 states have return successors, (964), 752 states have call predecessors, (964), 746 states have call successors, (964) [2025-01-09 03:50:24,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3991 states to 3991 states and 6742 transitions. [2025-01-09 03:50:24,609 INFO L78 Accepts]: Start accepts. Automaton has 3991 states and 6742 transitions. Word has length 159 [2025-01-09 03:50:24,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:50:24,610 INFO L471 AbstractCegarLoop]: Abstraction has 3991 states and 6742 transitions. [2025-01-09 03:50:24,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 03:50:24,610 INFO L276 IsEmpty]: Start isEmpty. Operand 3991 states and 6742 transitions. [2025-01-09 03:50:24,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-01-09 03:50:24,629 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:50:24,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, 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:50:24,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 03:50:24,629 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:50:24,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:50:24,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1453610617, now seen corresponding path program 1 times [2025-01-09 03:50:24,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:50:24,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662909009] [2025-01-09 03:50:24,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:50:24,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:50:24,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-01-09 03:50:24,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-01-09 03:50:24,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:50:24,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:50:24,683 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-01-09 03:50:24,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:50:24,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662909009] [2025-01-09 03:50:24,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662909009] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:50:24,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:50:24,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:50:24,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276477268] [2025-01-09 03:50:24,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:50:24,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:50:24,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:50:24,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:50:24,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:50:24,684 INFO L87 Difference]: Start difference. First operand 3991 states and 6742 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 03:50:24,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:50:24,813 INFO L93 Difference]: Finished difference Result 9493 states and 16150 transitions. [2025-01-09 03:50:24,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:50:24,813 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 160 [2025-01-09 03:50:24,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:50:24,841 INFO L225 Difference]: With dead ends: 9493 [2025-01-09 03:50:24,841 INFO L226 Difference]: Without dead ends: 5947 [2025-01-09 03:50:24,853 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:50:24,853 INFO L435 NwaCegarLoop]: 494 mSDtfsCounter, 102 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 982 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:50:24,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 982 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:50:24,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5947 states. [2025-01-09 03:50:25,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5947 to 5915. [2025-01-09 03:50:25,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5915 states, 4678 states have (on average 1.6135100470286448) internal successors, (7548), 4696 states have internal predecessors, (7548), 1130 states have call successors, (1130), 94 states have call predecessors, (1130), 106 states have return successors, (1408), 1132 states have call predecessors, (1408), 1126 states have call successors, (1408) [2025-01-09 03:50:25,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5915 states to 5915 states and 10086 transitions. [2025-01-09 03:50:25,165 INFO L78 Accepts]: Start accepts. Automaton has 5915 states and 10086 transitions. Word has length 160 [2025-01-09 03:50:25,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:50:25,165 INFO L471 AbstractCegarLoop]: Abstraction has 5915 states and 10086 transitions. [2025-01-09 03:50:25,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 03:50:25,170 INFO L276 IsEmpty]: Start isEmpty. Operand 5915 states and 10086 transitions. [2025-01-09 03:50:25,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-01-09 03:50:25,201 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:50:25,201 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, 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:50:25,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 03:50:25,201 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:50:25,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:50:25,201 INFO L85 PathProgramCache]: Analyzing trace with hash -560396831, now seen corresponding path program 1 times [2025-01-09 03:50:25,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:50:25,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456096434] [2025-01-09 03:50:25,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:50:25,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:50:25,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-01-09 03:50:25,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-01-09 03:50:25,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:50:25,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:50:25,261 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-01-09 03:50:25,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:50:25,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456096434] [2025-01-09 03:50:25,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456096434] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:50:25,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:50:25,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:50:25,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909410867] [2025-01-09 03:50:25,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:50:25,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:50:25,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:50:25,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:50:25,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:50:25,264 INFO L87 Difference]: Start difference. First operand 5915 states and 10086 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 03:50:25,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:50:25,527 INFO L93 Difference]: Finished difference Result 13789 states and 23742 transitions. [2025-01-09 03:50:25,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:50:25,528 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 161 [2025-01-09 03:50:25,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:50:25,601 INFO L225 Difference]: With dead ends: 13789 [2025-01-09 03:50:25,601 INFO L226 Difference]: Without dead ends: 8843 [2025-01-09 03:50:25,616 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:50:25,616 INFO L435 NwaCegarLoop]: 494 mSDtfsCounter, 100 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 979 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:50:25,616 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 979 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:50:25,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8843 states. [2025-01-09 03:50:25,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8843 to 8811. [2025-01-09 03:50:25,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8811 states, 7082 states have (on average 1.6210110138378988) internal successors, (11480), 7100 states have internal predecessors, (11480), 1622 states have call successors, (1622), 94 states have call predecessors, (1622), 106 states have return successors, (2068), 1624 states have call predecessors, (2068), 1618 states have call successors, (2068) [2025-01-09 03:50:25,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8811 states to 8811 states and 15170 transitions. [2025-01-09 03:50:25,903 INFO L78 Accepts]: Start accepts. Automaton has 8811 states and 15170 transitions. Word has length 161 [2025-01-09 03:50:25,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:50:25,903 INFO L471 AbstractCegarLoop]: Abstraction has 8811 states and 15170 transitions. [2025-01-09 03:50:25,904 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 03:50:25,904 INFO L276 IsEmpty]: Start isEmpty. Operand 8811 states and 15170 transitions. [2025-01-09 03:50:25,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-01-09 03:50:25,941 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:50:25,941 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, 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:50:25,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 03:50:25,942 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:50:25,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:50:25,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1520079304, now seen corresponding path program 1 times [2025-01-09 03:50:25,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:50:25,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227569088] [2025-01-09 03:50:25,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:50:25,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:50:25,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-01-09 03:50:25,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-01-09 03:50:25,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:50:25,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:50:26,039 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-01-09 03:50:26,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:50:26,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227569088] [2025-01-09 03:50:26,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227569088] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:50:26,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:50:26,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:50:26,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975509794] [2025-01-09 03:50:26,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:50:26,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:50:26,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:50:26,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:50:26,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:50:26,041 INFO L87 Difference]: Start difference. First operand 8811 states and 15170 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 03:50:26,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:50:26,283 INFO L93 Difference]: Finished difference Result 20441 states and 35530 transitions. [2025-01-09 03:50:26,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:50:26,287 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 162 [2025-01-09 03:50:26,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:50:26,336 INFO L225 Difference]: With dead ends: 20441 [2025-01-09 03:50:26,337 INFO L226 Difference]: Without dead ends: 13447 [2025-01-09 03:50:26,365 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:50:26,366 INFO L435 NwaCegarLoop]: 494 mSDtfsCounter, 98 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 979 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:50:26,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 979 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:50:26,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13447 states. [2025-01-09 03:50:26,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13447 to 13415. [2025-01-09 03:50:26,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13415 states, 10970 states have (on average 1.6258887876025525) internal successors, (17836), 10988 states have internal predecessors, (17836), 2338 states have call successors, (2338), 94 states have call predecessors, (2338), 106 states have return successors, (3064), 2340 states have call predecessors, (3064), 2334 states have call successors, (3064) [2025-01-09 03:50:26,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13415 states to 13415 states and 23238 transitions. [2025-01-09 03:50:27,003 INFO L78 Accepts]: Start accepts. Automaton has 13415 states and 23238 transitions. Word has length 162 [2025-01-09 03:50:27,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:50:27,004 INFO L471 AbstractCegarLoop]: Abstraction has 13415 states and 23238 transitions. [2025-01-09 03:50:27,004 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 03:50:27,005 INFO L276 IsEmpty]: Start isEmpty. Operand 13415 states and 23238 transitions. [2025-01-09 03:50:27,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-01-09 03:50:27,063 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:50:27,063 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, 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:50:27,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 03:50:27,063 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:50:27,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:50:27,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1093794597, now seen corresponding path program 1 times [2025-01-09 03:50:27,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:50:27,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60922486] [2025-01-09 03:50:27,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:50:27,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:50:27,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-01-09 03:50:27,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-01-09 03:50:27,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:50:27,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:50:27,138 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-01-09 03:50:27,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:50:27,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60922486] [2025-01-09 03:50:27,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60922486] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:50:27,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:50:27,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:50:27,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519430647] [2025-01-09 03:50:27,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:50:27,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:50:27,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:50:27,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:50:27,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:50:27,141 INFO L87 Difference]: Start difference. First operand 13415 states and 23238 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 03:50:27,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:50:27,729 INFO L93 Difference]: Finished difference Result 32425 states and 56574 transitions. [2025-01-09 03:50:27,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:50:27,729 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 163 [2025-01-09 03:50:27,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:50:27,820 INFO L225 Difference]: With dead ends: 32425 [2025-01-09 03:50:27,820 INFO L226 Difference]: Without dead ends: 21791 [2025-01-09 03:50:27,859 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:50:27,860 INFO L435 NwaCegarLoop]: 499 mSDtfsCounter, 96 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 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:50:27,860 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 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:50:27,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21791 states. [2025-01-09 03:50:28,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21791 to 21759. [2025-01-09 03:50:28,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21759 states, 17810 states have (on average 1.6193149915777654) internal successors, (28840), 17828 states have internal predecessors, (28840), 3842 states have call successors, (3842), 94 states have call predecessors, (3842), 106 states have return successors, (5056), 3844 states have call predecessors, (5056), 3838 states have call successors, (5056) [2025-01-09 03:50:28,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21759 states to 21759 states and 37738 transitions. [2025-01-09 03:50:28,634 INFO L78 Accepts]: Start accepts. Automaton has 21759 states and 37738 transitions. Word has length 163 [2025-01-09 03:50:28,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:50:28,635 INFO L471 AbstractCegarLoop]: Abstraction has 21759 states and 37738 transitions. [2025-01-09 03:50:28,635 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 03:50:28,635 INFO L276 IsEmpty]: Start isEmpty. Operand 21759 states and 37738 transitions. [2025-01-09 03:50:28,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-01-09 03:50:28,700 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:50:28,700 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:50:28,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 03:50:28,700 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:50:28,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:50:28,701 INFO L85 PathProgramCache]: Analyzing trace with hash -514702092, now seen corresponding path program 1 times [2025-01-09 03:50:28,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:50:28,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750219388] [2025-01-09 03:50:28,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:50:28,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:50:28,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-01-09 03:50:28,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-09 03:50:28,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:50:28,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:50:28,751 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-01-09 03:50:28,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:50:28,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750219388] [2025-01-09 03:50:28,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750219388] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:50:28,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:50:28,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:50:28,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898427083] [2025-01-09 03:50:28,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:50:28,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:50:28,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:50:28,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:50:28,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:50:28,753 INFO L87 Difference]: Start difference. First operand 21759 states and 37738 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 03:50:29,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:50:29,480 INFO L93 Difference]: Finished difference Result 53581 states and 93314 transitions. [2025-01-09 03:50:29,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:50:29,480 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 164 [2025-01-09 03:50:29,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:50:29,609 INFO L225 Difference]: With dead ends: 53581 [2025-01-09 03:50:29,609 INFO L226 Difference]: Without dead ends: 36147 [2025-01-09 03:50:29,647 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:50:29,648 INFO L435 NwaCegarLoop]: 505 mSDtfsCounter, 94 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 995 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:50:29,648 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 995 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:50:29,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36147 states. [2025-01-09 03:50:30,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36147 to 36115. [2025-01-09 03:50:30,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36115 states, 29742 states have (on average 1.6169726312958106) internal successors, (48092), 29760 states have internal predecessors, (48092), 6266 states have call successors, (6266), 94 states have call predecessors, (6266), 106 states have return successors, (8080), 6268 states have call predecessors, (8080), 6262 states have call successors, (8080) [2025-01-09 03:50:31,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36115 states to 36115 states and 62438 transitions. [2025-01-09 03:50:31,075 INFO L78 Accepts]: Start accepts. Automaton has 36115 states and 62438 transitions. Word has length 164 [2025-01-09 03:50:31,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:50:31,076 INFO L471 AbstractCegarLoop]: Abstraction has 36115 states and 62438 transitions. [2025-01-09 03:50:31,076 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 03:50:31,076 INFO L276 IsEmpty]: Start isEmpty. Operand 36115 states and 62438 transitions. [2025-01-09 03:50:31,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-01-09 03:50:31,194 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:50:31,195 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, 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:50:31,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 03:50:31,195 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:50:31,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:50:31,196 INFO L85 PathProgramCache]: Analyzing trace with hash -807416605, now seen corresponding path program 1 times [2025-01-09 03:50:31,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:50:31,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66320395] [2025-01-09 03:50:31,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:50:31,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:50:31,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-09 03:50:31,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-09 03:50:31,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:50:31,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:50:31,260 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-01-09 03:50:31,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:50:31,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66320395] [2025-01-09 03:50:31,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66320395] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:50:31,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:50:31,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:50:31,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784285882] [2025-01-09 03:50:31,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:50:31,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:50:31,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:50:31,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:50:31,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:50:31,262 INFO L87 Difference]: Start difference. First operand 36115 states and 62438 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 03:50:32,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:50:32,644 INFO L93 Difference]: Finished difference Result 93365 states and 162126 transitions. [2025-01-09 03:50:32,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:50:32,644 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 165 [2025-01-09 03:50:32,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:50:33,060 INFO L225 Difference]: With dead ends: 93365 [2025-01-09 03:50:33,060 INFO L226 Difference]: Without dead ends: 63295 [2025-01-09 03:50:33,117 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:50:33,118 INFO L435 NwaCegarLoop]: 507 mSDtfsCounter, 92 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 999 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:50:33,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 999 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:50:33,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63295 states. [2025-01-09 03:50:35,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63295 to 63263. [2025-01-09 03:50:35,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63263 states, 52078 states have (on average 1.6073581934790122) internal successors, (83708), 52096 states have internal predecessors, (83708), 11078 states have call successors, (11078), 94 states have call predecessors, (11078), 106 states have return successors, (14304), 11080 states have call predecessors, (14304), 11074 states have call successors, (14304) [2025-01-09 03:50:35,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63263 states to 63263 states and 109090 transitions. [2025-01-09 03:50:35,910 INFO L78 Accepts]: Start accepts. Automaton has 63263 states and 109090 transitions. Word has length 165 [2025-01-09 03:50:35,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:50:35,911 INFO L471 AbstractCegarLoop]: Abstraction has 63263 states and 109090 transitions. [2025-01-09 03:50:35,911 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 03:50:35,911 INFO L276 IsEmpty]: Start isEmpty. Operand 63263 states and 109090 transitions. [2025-01-09 03:50:36,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-01-09 03:50:36,060 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:50:36,060 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, 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:50:36,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 03:50:36,060 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:50:36,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:50:36,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1799903981, now seen corresponding path program 1 times [2025-01-09 03:50:36,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:50:36,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134621818] [2025-01-09 03:50:36,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:50:36,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:50:36,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-01-09 03:50:36,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-01-09 03:50:36,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:50:36,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:50:36,106 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-01-09 03:50:36,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:50:36,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134621818] [2025-01-09 03:50:36,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134621818] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:50:36,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:50:36,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:50:36,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598301907] [2025-01-09 03:50:36,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:50:36,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:50:36,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:50:36,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:50:36,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:50:36,107 INFO L87 Difference]: Start difference. First operand 63263 states and 109090 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 03:50:38,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:50:38,761 INFO L93 Difference]: Finished difference Result 167469 states and 290214 transitions. [2025-01-09 03:50:38,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:50:38,762 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 166 [2025-01-09 03:50:38,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:50:39,201 INFO L225 Difference]: With dead ends: 167469 [2025-01-09 03:50:39,201 INFO L226 Difference]: Without dead ends: 112703 [2025-01-09 03:50:39,610 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:50:39,614 INFO L435 NwaCegarLoop]: 494 mSDtfsCounter, 90 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 982 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:50:39,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 982 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:50:39,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112703 states. [2025-01-09 03:50:43,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112703 to 112671. [2025-01-09 03:50:43,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112671 states, 93330 states have (on average 1.6025286617379193) internal successors, (149564), 93348 states have internal predecessors, (149564), 19234 states have call successors, (19234), 94 states have call predecessors, (19234), 106 states have return successors, (25168), 19236 states have call predecessors, (25168), 19230 states have call successors, (25168) [2025-01-09 03:50:43,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112671 states to 112671 states and 193966 transitions. [2025-01-09 03:50:43,671 INFO L78 Accepts]: Start accepts. Automaton has 112671 states and 193966 transitions. Word has length 166 [2025-01-09 03:50:43,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:50:43,671 INFO L471 AbstractCegarLoop]: Abstraction has 112671 states and 193966 transitions. [2025-01-09 03:50:43,672 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 03:50:43,672 INFO L276 IsEmpty]: Start isEmpty. Operand 112671 states and 193966 transitions. [2025-01-09 03:50:44,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-01-09 03:50:44,183 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:50:44,183 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:50:44,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 03:50:44,184 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:50:44,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:50:44,184 INFO L85 PathProgramCache]: Analyzing trace with hash -488650175, now seen corresponding path program 1 times [2025-01-09 03:50:44,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:50:44,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216640675] [2025-01-09 03:50:44,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:50:44,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:50:44,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-01-09 03:50:44,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-01-09 03:50:44,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:50:44,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:50:44,227 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-01-09 03:50:44,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:50:44,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216640675] [2025-01-09 03:50:44,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216640675] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:50:44,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:50:44,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:50:44,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038519085] [2025-01-09 03:50:44,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:50:44,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:50:44,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:50:44,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:50:44,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:50:44,229 INFO L87 Difference]: Start difference. First operand 112671 states and 193966 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 03:50:48,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:50:48,833 INFO L93 Difference]: Finished difference Result 307177 states and 528662 transitions. [2025-01-09 03:50:48,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:50:48,834 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 167 [2025-01-09 03:50:48,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:50:49,521 INFO L225 Difference]: With dead ends: 307177 [2025-01-09 03:50:49,521 INFO L226 Difference]: Without dead ends: 205943 [2025-01-09 03:50:49,768 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:50:49,769 INFO L435 NwaCegarLoop]: 496 mSDtfsCounter, 88 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 984 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:50:49,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 984 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:50:49,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205943 states. [2025-01-09 03:50:56,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205943 to 205911. [2025-01-09 03:50:56,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205911 states, 171710 states have (on average 1.5962960806010134) internal successors, (274100), 171728 states have internal predecessors, (274100), 34094 states have call successors, (34094), 94 states have call predecessors, (34094), 106 states have return successors, (43220), 34096 states have call predecessors, (43220), 34090 states have call successors, (43220) [2025-01-09 03:50:57,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205911 states to 205911 states and 351414 transitions. [2025-01-09 03:50:57,317 INFO L78 Accepts]: Start accepts. Automaton has 205911 states and 351414 transitions. Word has length 167 [2025-01-09 03:50:57,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:50:57,322 INFO L471 AbstractCegarLoop]: Abstraction has 205911 states and 351414 transitions. [2025-01-09 03:50:57,323 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 03:50:57,323 INFO L276 IsEmpty]: Start isEmpty. Operand 205911 states and 351414 transitions. [2025-01-09 03:50:58,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-01-09 03:50:58,254 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:50:58,254 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:50:58,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 03:50:58,254 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:50:58,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:50:58,255 INFO L85 PathProgramCache]: Analyzing trace with hash 281374835, now seen corresponding path program 1 times [2025-01-09 03:50:58,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:50:58,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831116124] [2025-01-09 03:50:58,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:50:58,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:50:58,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-01-09 03:50:58,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-01-09 03:50:58,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:50:58,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:50:58,320 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-01-09 03:50:58,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:50:58,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831116124] [2025-01-09 03:50:58,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831116124] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:50:58,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:50:58,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:50:58,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402234524] [2025-01-09 03:50:58,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:50:58,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:50:58,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:50:58,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:50:58,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:50:58,322 INFO L87 Difference]: Start difference. First operand 205911 states and 351414 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17)