./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec0_product31.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_spec0_product31.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 c46ce92d5d51a05028bbc31057066da504d1448a24c04513108ae9144a2ce103 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 03:49:19,607 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 03:49:19,660 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:49:19,663 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 03:49:19,664 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 03:49:19,678 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 03:49:19,679 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 03:49:19,679 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 03:49:19,679 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 03:49:19,679 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 03:49:19,679 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 03:49:19,679 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 03:49:19,680 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 03:49:19,680 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 03:49:19,680 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 03:49:19,680 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 03:49:19,680 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 03:49:19,680 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 03:49:19,680 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 03:49:19,680 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 03:49:19,680 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 03:49:19,680 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 03:49:19,680 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 03:49:19,680 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 03:49:19,680 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 03:49:19,680 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 03:49:19,680 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 03:49:19,680 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 03:49:19,681 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 03:49:19,681 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:49:19,681 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:49:19,681 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:49:19,681 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:49:19,681 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 03:49:19,681 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:49:19,681 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:49:19,681 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:49:19,681 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:49:19,681 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 03:49:19,681 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 03:49:19,681 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 03:49:19,681 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 03:49:19,681 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 03:49:19,681 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 03:49:19,681 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 03:49:19,681 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 03:49:19,681 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 03:49:19,682 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 03:49:19,682 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 -> c46ce92d5d51a05028bbc31057066da504d1448a24c04513108ae9144a2ce103 [2025-01-09 03:49:19,891 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 03:49:19,907 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 03:49:19,910 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 03:49:19,910 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 03:49:19,911 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 03:49:19,912 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec0_product31.cil.c [2025-01-09 03:49:21,092 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cf06247f5/3cd84306d96842eeb6261caef3646c7c/FLAG314944ea5 [2025-01-09 03:49:21,430 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 03:49:21,431 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec0_product31.cil.c [2025-01-09 03:49:21,447 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cf06247f5/3cd84306d96842eeb6261caef3646c7c/FLAG314944ea5 [2025-01-09 03:49:21,684 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cf06247f5/3cd84306d96842eeb6261caef3646c7c [2025-01-09 03:49:21,686 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 03:49:21,689 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 03:49:21,692 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 03:49:21,692 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 03:49:21,696 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 03:49:21,701 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:49:21" (1/1) ... [2025-01-09 03:49:21,706 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12f1f91a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:49:21, skipping insertion in model container [2025-01-09 03:49:21,706 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:49:21" (1/1) ... [2025-01-09 03:49:21,783 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 03:49:22,352 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec0_product31.cil.c[35932,35945] [2025-01-09 03:49:22,435 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:49:22,453 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 03:49:22,461 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [48] [2025-01-09 03:49:22,463 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [460] [2025-01-09 03:49:22,463 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [826] [2025-01-09 03:49:22,464 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [1051] [2025-01-09 03:49:22,464 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [1356] [2025-01-09 03:49:22,464 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"DecryptForward_spec.i","") [1716] [2025-01-09 03:49:22,464 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [1736] [2025-01-09 03:49:22,464 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1771] [2025-01-09 03:49:22,465 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [1780] [2025-01-09 03:49:22,465 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [2847] [2025-01-09 03:49:22,465 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [2982] [2025-01-09 03:49:22,522 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec0_product31.cil.c[35932,35945] [2025-01-09 03:49:22,557 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:49:22,587 INFO L204 MainTranslator]: Completed translation [2025-01-09 03:49:22,589 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:49:22 WrapperNode [2025-01-09 03:49:22,589 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 03:49:22,590 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 03:49:22,590 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 03:49:22,590 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 03:49:22,596 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:49:22" (1/1) ... [2025-01-09 03:49:22,621 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:49:22" (1/1) ... [2025-01-09 03:49:22,655 INFO L138 Inliner]: procedures = 131, calls = 203, calls flagged for inlining = 61, calls inlined = 56, statements flattened = 1017 [2025-01-09 03:49:22,655 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 03:49:22,656 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 03:49:22,656 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 03:49:22,656 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 03:49:22,666 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:49:22" (1/1) ... [2025-01-09 03:49:22,667 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:49:22" (1/1) ... [2025-01-09 03:49:22,671 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:49:22" (1/1) ... [2025-01-09 03:49:22,693 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:49:22,694 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:49:22" (1/1) ... [2025-01-09 03:49:22,694 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:49:22" (1/1) ... [2025-01-09 03:49:22,712 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:49:22" (1/1) ... [2025-01-09 03:49:22,714 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:49:22" (1/1) ... [2025-01-09 03:49:22,720 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:49:22" (1/1) ... [2025-01-09 03:49:22,723 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:49:22" (1/1) ... [2025-01-09 03:49:22,729 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:49:22" (1/1) ... [2025-01-09 03:49:22,734 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 03:49:22,734 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 03:49:22,734 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 03:49:22,734 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 03:49:22,735 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:49:22" (1/1) ... [2025-01-09 03:49:22,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:49:22,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:49:22,762 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:49:22,767 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:49:22,797 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2025-01-09 03:49:22,798 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2025-01-09 03:49:22,798 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-01-09 03:49:22,798 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-01-09 03:49:22,798 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-01-09 03:49:22,798 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-01-09 03:49:22,798 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-01-09 03:49:22,798 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-01-09 03:49:22,798 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-01-09 03:49:22,798 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-01-09 03:49:22,798 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-01-09 03:49:22,798 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-01-09 03:49:22,798 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-01-09 03:49:22,798 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-01-09 03:49:22,798 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-01-09 03:49:22,798 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-01-09 03:49:22,798 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-01-09 03:49:22,798 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-01-09 03:49:22,798 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-01-09 03:49:22,798 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-01-09 03:49:22,798 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-01-09 03:49:22,799 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-01-09 03:49:22,799 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-01-09 03:49:22,799 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-01-09 03:49:22,799 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 03:49:22,799 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-01-09 03:49:22,799 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-01-09 03:49:22,799 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2025-01-09 03:49:22,799 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2025-01-09 03:49:22,799 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-01-09 03:49:22,799 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-01-09 03:49:22,799 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-01-09 03:49:22,799 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-01-09 03:49:22,799 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-01-09 03:49:22,799 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-01-09 03:49:22,799 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2025-01-09 03:49:22,799 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2025-01-09 03:49:22,799 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-01-09 03:49:22,799 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-01-09 03:49:22,799 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-01-09 03:49:22,799 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-01-09 03:49:22,799 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-01-09 03:49:22,799 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-01-09 03:49:22,799 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-01-09 03:49:22,799 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-01-09 03:49:22,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 03:49:22,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 03:49:22,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 03:49:22,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 03:49:22,799 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-01-09 03:49:22,799 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-01-09 03:49:22,800 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 03:49:22,800 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 03:49:23,007 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 03:49:23,009 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 03:49:23,766 INFO L? ?]: Removed 473 outVars from TransFormulas that were not future-live. [2025-01-09 03:49:23,766 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 03:49:23,782 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 03:49:23,782 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 03:49:23,783 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:49:23 BoogieIcfgContainer [2025-01-09 03:49:23,783 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 03:49:23,784 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 03:49:23,787 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 03:49:23,824 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 03:49:23,825 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:49:21" (1/3) ... [2025-01-09 03:49:23,825 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10e40653 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:49:23, skipping insertion in model container [2025-01-09 03:49:23,828 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:49:22" (2/3) ... [2025-01-09 03:49:23,829 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10e40653 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:49:23, skipping insertion in model container [2025-01-09 03:49:23,829 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:49:23" (3/3) ... [2025-01-09 03:49:23,830 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec0_product31.cil.c [2025-01-09 03:49:23,840 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 03:49:23,842 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec0_product31.cil.c that has 24 procedures, 365 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 03:49:23,885 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 03:49:23,894 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;@3eb0b212, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 03:49:23,895 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 03:49:23,900 INFO L276 IsEmpty]: Start isEmpty. Operand has 365 states, 282 states have (on average 1.5) internal successors, (423), 286 states have internal predecessors, (423), 58 states have call successors, (58), 23 states have call predecessors, (58), 23 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2025-01-09 03:49:23,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-01-09 03:49:23,912 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:49:23,913 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, 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:49:23,913 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:49:23,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:49:23,917 INFO L85 PathProgramCache]: Analyzing trace with hash 402516569, now seen corresponding path program 1 times [2025-01-09 03:49:23,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:49:23,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182986986] [2025-01-09 03:49:23,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:49:23,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:49:23,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 03:49:24,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 03:49:24,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:49:24,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:49:24,459 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-01-09 03:49:24,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:49:24,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182986986] [2025-01-09 03:49:24,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182986986] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:49:24,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1137775274] [2025-01-09 03:49:24,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:49:24,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:49:24,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:49:24,466 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:49:24,468 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:49:24,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 03:49:24,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 03:49:24,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:49:24,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:49:24,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 1195 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 03:49:24,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:49:24,782 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-01-09 03:49:24,782 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:49:24,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1137775274] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:49:24,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:49:24,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2025-01-09 03:49:24,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539304376] [2025-01-09 03:49:24,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:49:24,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 03:49:24,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:49:24,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 03:49:24,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:49:24,803 INFO L87 Difference]: Start difference. First operand has 365 states, 282 states have (on average 1.5) internal successors, (423), 286 states have internal predecessors, (423), 58 states have call successors, (58), 23 states have call predecessors, (58), 23 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) Second operand has 2 states, 2 states have (on average 37.0) internal successors, (74), 2 states have internal predecessors, (74), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 03:49:24,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:49:24,855 INFO L93 Difference]: Finished difference Result 577 states and 834 transitions. [2025-01-09 03:49:24,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 03:49:24,857 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 37.0) internal successors, (74), 2 states have internal predecessors, (74), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 145 [2025-01-09 03:49:24,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:49:24,865 INFO L225 Difference]: With dead ends: 577 [2025-01-09 03:49:24,865 INFO L226 Difference]: Without dead ends: 358 [2025-01-09 03:49:24,869 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 146 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:49:24,871 INFO L435 NwaCegarLoop]: 536 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, 536 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:49:24,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:49:24,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2025-01-09 03:49:24,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 358. [2025-01-09 03:49:24,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 276 states have (on average 1.4963768115942029) internal successors, (413), 279 states have internal predecessors, (413), 58 states have call successors, (58), 23 states have call predecessors, (58), 23 states have return successors, (57), 57 states have call predecessors, (57), 57 states have call successors, (57) [2025-01-09 03:49:24,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 528 transitions. [2025-01-09 03:49:24,921 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 528 transitions. Word has length 145 [2025-01-09 03:49:24,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:49:24,922 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 528 transitions. [2025-01-09 03:49:24,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 37.0) internal successors, (74), 2 states have internal predecessors, (74), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 03:49:24,923 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 528 transitions. [2025-01-09 03:49:24,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-01-09 03:49:24,927 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:49:24,927 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, 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:49:24,936 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:49:25,127 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:49:25,128 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:49:25,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:49:25,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1615434547, now seen corresponding path program 1 times [2025-01-09 03:49:25,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:49:25,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147905275] [2025-01-09 03:49:25,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:49:25,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:49:25,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 03:49:25,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 03:49:25,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:49:25,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:49:25,441 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-01-09 03:49:25,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:49:25,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147905275] [2025-01-09 03:49:25,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147905275] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:49:25,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1422652365] [2025-01-09 03:49:25,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:49:25,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:49:25,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:49:25,448 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:49:25,452 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:49:25,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 03:49:25,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 03:49:25,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:49:25,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:49:25,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 1195 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 03:49:25,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:49:25,760 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-01-09 03:49:25,760 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:49:25,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1422652365] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:49:25,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:49:25,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 03:49:25,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915585185] [2025-01-09 03:49:25,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:49:25,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:49:25,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:49:25,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:49:25,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:49:25,763 INFO L87 Difference]: Start difference. First operand 358 states and 528 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 03:49:25,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:49:25,797 INFO L93 Difference]: Finished difference Result 566 states and 815 transitions. [2025-01-09 03:49:25,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:49:25,799 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 145 [2025-01-09 03:49:25,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:49:25,802 INFO L225 Difference]: With dead ends: 566 [2025-01-09 03:49:25,802 INFO L226 Difference]: Without dead ends: 360 [2025-01-09 03:49:25,803 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 145 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:49:25,804 INFO L435 NwaCegarLoop]: 526 mSDtfsCounter, 1 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1050 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:49:25,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1050 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:49:25,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2025-01-09 03:49:25,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 359. [2025-01-09 03:49:25,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 277 states have (on average 1.4945848375451263) internal successors, (414), 280 states have internal predecessors, (414), 58 states have call successors, (58), 23 states have call predecessors, (58), 23 states have return successors, (57), 57 states have call predecessors, (57), 57 states have call successors, (57) [2025-01-09 03:49:25,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 529 transitions. [2025-01-09 03:49:25,820 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 529 transitions. Word has length 145 [2025-01-09 03:49:25,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:49:25,820 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 529 transitions. [2025-01-09 03:49:25,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 03:49:25,821 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 529 transitions. [2025-01-09 03:49:25,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-01-09 03:49:25,823 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:49:25,823 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:49:25,831 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:49:26,023 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:49:26,024 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:49:26,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:49:26,025 INFO L85 PathProgramCache]: Analyzing trace with hash 295371343, now seen corresponding path program 1 times [2025-01-09 03:49:26,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:49:26,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108804981] [2025-01-09 03:49:26,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:49:26,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:49:26,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-09 03:49:26,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-09 03:49:26,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:49:26,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:49:26,218 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-01-09 03:49:26,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:49:26,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108804981] [2025-01-09 03:49:26,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108804981] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:49:26,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [706948034] [2025-01-09 03:49:26,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:49:26,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:49:26,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:49:26,221 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:49:26,222 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:49:26,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-09 03:49:26,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-09 03:49:26,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:49:26,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:49:26,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 1206 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:49:26,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:49:26,516 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-01-09 03:49:26,516 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:49:26,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [706948034] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:49:26,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:49:26,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 03:49:26,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352081970] [2025-01-09 03:49:26,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:49:26,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:49:26,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:49:26,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:49:26,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:49:26,518 INFO L87 Difference]: Start difference. First operand 359 states and 529 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 03:49:26,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:49:26,543 INFO L93 Difference]: Finished difference Result 748 states and 1117 transitions. [2025-01-09 03:49:26,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:49:26,544 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 150 [2025-01-09 03:49:26,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:49:26,546 INFO L225 Difference]: With dead ends: 748 [2025-01-09 03:49:26,546 INFO L226 Difference]: Without dead ends: 415 [2025-01-09 03:49:26,547 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:49:26,547 INFO L435 NwaCegarLoop]: 539 mSDtfsCounter, 107 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 1019 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:49:26,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 1019 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:49:26,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2025-01-09 03:49:26,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 407. [2025-01-09 03:49:26,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 314 states have (on average 1.5127388535031847) internal successors, (475), 317 states have internal predecessors, (475), 69 states have call successors, (69), 23 states have call predecessors, (69), 23 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2025-01-09 03:49:26,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 612 transitions. [2025-01-09 03:49:26,565 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 612 transitions. Word has length 150 [2025-01-09 03:49:26,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:49:26,565 INFO L471 AbstractCegarLoop]: Abstraction has 407 states and 612 transitions. [2025-01-09 03:49:26,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 03:49:26,566 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 612 transitions. [2025-01-09 03:49:26,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-01-09 03:49:26,567 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:49:26,568 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:49:26,575 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:49:26,768 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:49:26,769 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:49:26,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:49:26,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1637912156, now seen corresponding path program 1 times [2025-01-09 03:49:26,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:49:26,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989225701] [2025-01-09 03:49:26,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:49:26,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:49:26,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 03:49:26,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 03:49:26,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:49:26,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:49:26,954 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-01-09 03:49:26,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:49:26,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989225701] [2025-01-09 03:49:26,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989225701] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:49:26,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509439367] [2025-01-09 03:49:26,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:49:26,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:49:26,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:49:26,960 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:49:26,962 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:49:27,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 03:49:27,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 03:49:27,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:49:27,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:49:27,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 1211 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 03:49:27,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:49:27,251 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-01-09 03:49:27,251 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:49:27,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [509439367] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:49:27,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:49:27,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-01-09 03:49:27,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466024978] [2025-01-09 03:49:27,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:49:27,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:49:27,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:49:27,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:49:27,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:49:27,253 INFO L87 Difference]: Start difference. First operand 407 states and 612 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, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2025-01-09 03:49:27,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:49:27,298 INFO L93 Difference]: Finished difference Result 805 states and 1214 transitions. [2025-01-09 03:49:27,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:49:27,299 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, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) Word has length 151 [2025-01-09 03:49:27,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:49:27,301 INFO L225 Difference]: With dead ends: 805 [2025-01-09 03:49:27,301 INFO L226 Difference]: Without dead ends: 409 [2025-01-09 03:49:27,302 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:49:27,303 INFO L435 NwaCegarLoop]: 520 mSDtfsCounter, 2 mSDsluCounter, 1549 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2069 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:49:27,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2069 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:49:27,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2025-01-09 03:49:27,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 409. [2025-01-09 03:49:27,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 315 states have (on average 1.511111111111111) internal successors, (476), 319 states have internal predecessors, (476), 69 states have call successors, (69), 23 states have call predecessors, (69), 24 states have return successors, (70), 68 states have call predecessors, (70), 68 states have call successors, (70) [2025-01-09 03:49:27,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 615 transitions. [2025-01-09 03:49:27,322 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 615 transitions. Word has length 151 [2025-01-09 03:49:27,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:49:27,322 INFO L471 AbstractCegarLoop]: Abstraction has 409 states and 615 transitions. [2025-01-09 03:49:27,322 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, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2025-01-09 03:49:27,323 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 615 transitions. [2025-01-09 03:49:27,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-01-09 03:49:27,325 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:49:27,325 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:49:27,333 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:49:27,525 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:49:27,526 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:49:27,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:49:27,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1375556329, now seen corresponding path program 1 times [2025-01-09 03:49:27,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:49:27,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308051261] [2025-01-09 03:49:27,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:49:27,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:49:27,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-01-09 03:49:27,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-01-09 03:49:27,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:49:27,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:49:27,668 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-01-09 03:49:27,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:49:27,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308051261] [2025-01-09 03:49:27,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308051261] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:49:27,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [340519136] [2025-01-09 03:49:27,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:49:27,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:49:27,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:49:27,671 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:49:27,672 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:49:27,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-01-09 03:49:27,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-01-09 03:49:27,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:49:27,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:49:27,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 1212 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 03:49:27,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:49:27,959 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-01-09 03:49:27,960 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:49:27,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [340519136] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:49:27,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:49:27,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-01-09 03:49:27,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29103135] [2025-01-09 03:49:27,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:49:27,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:49:27,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:49:27,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:49:27,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:49:27,961 INFO L87 Difference]: Start difference. First operand 409 states and 615 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-01-09 03:49:28,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:49:28,011 INFO L93 Difference]: Finished difference Result 807 states and 1219 transitions. [2025-01-09 03:49:28,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:49:28,012 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 152 [2025-01-09 03:49:28,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:49:28,018 INFO L225 Difference]: With dead ends: 807 [2025-01-09 03:49:28,018 INFO L226 Difference]: Without dead ends: 411 [2025-01-09 03:49:28,019 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:49:28,020 INFO L435 NwaCegarLoop]: 518 mSDtfsCounter, 2 mSDsluCounter, 1537 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2055 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:49:28,020 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2055 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:49:28,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2025-01-09 03:49:28,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 411. [2025-01-09 03:49:28,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 316 states have (on average 1.509493670886076) internal successors, (477), 321 states have internal predecessors, (477), 69 states have call successors, (69), 23 states have call predecessors, (69), 25 states have return successors, (75), 68 states have call predecessors, (75), 68 states have call successors, (75) [2025-01-09 03:49:28,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 621 transitions. [2025-01-09 03:49:28,034 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 621 transitions. Word has length 152 [2025-01-09 03:49:28,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:49:28,034 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 621 transitions. [2025-01-09 03:49:28,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-01-09 03:49:28,034 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 621 transitions. [2025-01-09 03:49:28,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 03:49:28,036 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:49:28,036 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:49:28,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 03:49:28,237 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:49:28,238 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:49:28,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:49:28,238 INFO L85 PathProgramCache]: Analyzing trace with hash -299391665, now seen corresponding path program 1 times [2025-01-09 03:49:28,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:49:28,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669217647] [2025-01-09 03:49:28,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:49:28,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:49:28,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 03:49:28,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 03:49:28,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:49:28,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:49:28,398 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-01-09 03:49:28,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:49:28,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669217647] [2025-01-09 03:49:28,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669217647] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:49:28,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:49:28,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:49:28,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508348480] [2025-01-09 03:49:28,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:49:28,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:49:28,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:49:28,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:49:28,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:49:28,400 INFO L87 Difference]: Start difference. First operand 411 states and 621 transitions. Second operand has 5 states, 4 states have (on average 21.75) internal successors, (87), 5 states have internal predecessors, (87), 3 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2025-01-09 03:49:28,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:49:28,433 INFO L93 Difference]: Finished difference Result 799 states and 1210 transitions. [2025-01-09 03:49:28,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:49:28,433 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.75) internal successors, (87), 5 states have internal predecessors, (87), 3 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) Word has length 153 [2025-01-09 03:49:28,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:49:28,435 INFO L225 Difference]: With dead ends: 799 [2025-01-09 03:49:28,436 INFO L226 Difference]: Without dead ends: 411 [2025-01-09 03:49:28,437 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:49:28,437 INFO L435 NwaCegarLoop]: 521 mSDtfsCounter, 2 mSDsluCounter, 1552 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2073 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:49:28,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2073 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:49:28,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2025-01-09 03:49:28,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 411. [2025-01-09 03:49:28,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 316 states have (on average 1.509493670886076) internal successors, (477), 321 states have internal predecessors, (477), 69 states have call successors, (69), 23 states have call predecessors, (69), 25 states have return successors, (74), 68 states have call predecessors, (74), 68 states have call successors, (74) [2025-01-09 03:49:28,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 620 transitions. [2025-01-09 03:49:28,462 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 620 transitions. Word has length 153 [2025-01-09 03:49:28,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:49:28,462 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 620 transitions. [2025-01-09 03:49:28,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.75) internal successors, (87), 5 states have internal predecessors, (87), 3 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2025-01-09 03:49:28,462 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 620 transitions. [2025-01-09 03:49:28,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-01-09 03:49:28,464 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:49:28,464 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:49:28,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 03:49:28,464 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:49:28,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:49:28,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1784337248, now seen corresponding path program 2 times [2025-01-09 03:49:28,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:49:28,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431071921] [2025-01-09 03:49:28,465 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 03:49:28,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:49:28,484 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 154 statements into 2 equivalence classes. [2025-01-09 03:49:28,490 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 58 of 154 statements. [2025-01-09 03:49:28,490 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 03:49:28,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:49:28,609 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-01-09 03:49:28,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:49:28,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431071921] [2025-01-09 03:49:28,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431071921] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:49:28,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:49:28,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 03:49:28,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303250329] [2025-01-09 03:49:28,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:49:28,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:49:28,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:49:28,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:49:28,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:49:28,612 INFO L87 Difference]: Start difference. First operand 411 states and 620 transitions. Second operand has 8 states, 8 states have (on average 11.125) internal successors, (89), 7 states have internal predecessors, (89), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 4 states have call predecessors, (18), 3 states have call successors, (18) [2025-01-09 03:49:29,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:49:29,109 INFO L93 Difference]: Finished difference Result 1141 states and 1699 transitions. [2025-01-09 03:49:29,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 03:49:29,110 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.125) internal successors, (89), 7 states have internal predecessors, (89), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 4 states have call predecessors, (18), 3 states have call successors, (18) Word has length 154 [2025-01-09 03:49:29,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:49:29,122 INFO L225 Difference]: With dead ends: 1141 [2025-01-09 03:49:29,122 INFO L226 Difference]: Without dead ends: 943 [2025-01-09 03:49:29,127 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-01-09 03:49:29,128 INFO L435 NwaCegarLoop]: 531 mSDtfsCounter, 676 mSDsluCounter, 3004 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 697 SdHoareTripleChecker+Valid, 3535 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 03:49:29,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [697 Valid, 3535 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 03:49:29,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2025-01-09 03:49:29,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 803. [2025-01-09 03:49:29,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 803 states, 621 states have (on average 1.5185185185185186) internal successors, (943), 628 states have internal predecessors, (943), 132 states have call successors, (132), 46 states have call predecessors, (132), 49 states have return successors, (145), 132 states have call predecessors, (145), 130 states have call successors, (145) [2025-01-09 03:49:29,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1220 transitions. [2025-01-09 03:49:29,195 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1220 transitions. Word has length 154 [2025-01-09 03:49:29,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:49:29,195 INFO L471 AbstractCegarLoop]: Abstraction has 803 states and 1220 transitions. [2025-01-09 03:49:29,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.125) internal successors, (89), 7 states have internal predecessors, (89), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 4 states have call predecessors, (18), 3 states have call successors, (18) [2025-01-09 03:49:29,195 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1220 transitions. [2025-01-09 03:49:29,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 03:49:29,198 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:49:29,198 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, 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:49:29,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 03:49:29,199 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:49:29,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:49:29,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1900196830, now seen corresponding path program 1 times [2025-01-09 03:49:29,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:49:29,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900745653] [2025-01-09 03:49:29,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:49:29,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:49:29,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 03:49:29,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 03:49:29,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:49:29,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:49:29,352 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-01-09 03:49:29,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:49:29,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900745653] [2025-01-09 03:49:29,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900745653] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:49:29,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:49:29,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:49:29,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431257701] [2025-01-09 03:49:29,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:49:29,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:49:29,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:49:29,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:49:29,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:49:29,355 INFO L87 Difference]: Start difference. First operand 803 states and 1220 transitions. Second operand has 5 states, 4 states have (on average 22.5) internal successors, (90), 5 states have internal predecessors, (90), 3 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2025-01-09 03:49:29,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:49:29,404 INFO L93 Difference]: Finished difference Result 1585 states and 2413 transitions. [2025-01-09 03:49:29,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:49:29,406 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 22.5) internal successors, (90), 5 states have internal predecessors, (90), 3 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) Word has length 155 [2025-01-09 03:49:29,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:49:29,413 INFO L225 Difference]: With dead ends: 1585 [2025-01-09 03:49:29,413 INFO L226 Difference]: Without dead ends: 805 [2025-01-09 03:49:29,416 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:49:29,416 INFO L435 NwaCegarLoop]: 522 mSDtfsCounter, 1 mSDsluCounter, 1554 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2076 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:49:29,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2076 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:49:29,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2025-01-09 03:49:29,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 805. [2025-01-09 03:49:29,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 805 states, 622 states have (on average 1.517684887459807) internal successors, (944), 630 states have internal predecessors, (944), 132 states have call successors, (132), 46 states have call predecessors, (132), 50 states have return successors, (147), 132 states have call predecessors, (147), 130 states have call successors, (147) [2025-01-09 03:49:29,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1223 transitions. [2025-01-09 03:49:29,447 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1223 transitions. Word has length 155 [2025-01-09 03:49:29,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:49:29,448 INFO L471 AbstractCegarLoop]: Abstraction has 805 states and 1223 transitions. [2025-01-09 03:49:29,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 22.5) internal successors, (90), 5 states have internal predecessors, (90), 3 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2025-01-09 03:49:29,448 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1223 transitions. [2025-01-09 03:49:29,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-01-09 03:49:29,451 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:49:29,451 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, 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:49:29,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 03:49:29,451 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:49:29,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:49:29,452 INFO L85 PathProgramCache]: Analyzing trace with hash 212529482, now seen corresponding path program 1 times [2025-01-09 03:49:29,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:49:29,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801452817] [2025-01-09 03:49:29,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:49:29,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:49:29,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-01-09 03:49:29,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-01-09 03:49:29,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:49:29,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:49:29,612 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-01-09 03:49:29,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:49:29,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801452817] [2025-01-09 03:49:29,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801452817] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:49:29,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:49:29,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 03:49:29,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175785758] [2025-01-09 03:49:29,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:49:29,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:49:29,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:49:29,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:49:29,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:49:29,614 INFO L87 Difference]: Start difference. First operand 805 states and 1223 transitions. Second operand has 8 states, 7 states have (on average 13.428571428571429) internal successors, (94), 8 states have internal predecessors, (94), 4 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-01-09 03:49:29,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:49:29,729 INFO L93 Difference]: Finished difference Result 1192 states and 1809 transitions. [2025-01-09 03:49:29,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 03:49:29,730 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 13.428571428571429) internal successors, (94), 8 states have internal predecessors, (94), 4 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 156 [2025-01-09 03:49:29,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:49:29,733 INFO L225 Difference]: With dead ends: 1192 [2025-01-09 03:49:29,733 INFO L226 Difference]: Without dead ends: 415 [2025-01-09 03:49:29,735 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:49:29,736 INFO L435 NwaCegarLoop]: 512 mSDtfsCounter, 7 mSDsluCounter, 3043 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3555 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:49:29,736 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3555 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:49:29,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2025-01-09 03:49:29,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 415. [2025-01-09 03:49:29,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 319 states have (on average 1.5047021943573669) internal successors, (480), 324 states have internal predecessors, (480), 69 states have call successors, (69), 24 states have call predecessors, (69), 26 states have return successors, (75), 68 states have call predecessors, (75), 68 states have call successors, (75) [2025-01-09 03:49:29,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 624 transitions. [2025-01-09 03:49:29,751 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 624 transitions. Word has length 156 [2025-01-09 03:49:29,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:49:29,751 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 624 transitions. [2025-01-09 03:49:29,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 13.428571428571429) internal successors, (94), 8 states have internal predecessors, (94), 4 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-01-09 03:49:29,752 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 624 transitions. [2025-01-09 03:49:29,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-01-09 03:49:29,754 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:49:29,754 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, 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:49:29,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 03:49:29,754 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:49:29,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:49:29,754 INFO L85 PathProgramCache]: Analyzing trace with hash -208094110, now seen corresponding path program 1 times [2025-01-09 03:49:29,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:49:29,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813955192] [2025-01-09 03:49:29,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:49:29,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:49:29,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-01-09 03:49:29,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-01-09 03:49:29,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:49:29,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:49:29,884 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-01-09 03:49:29,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:49:29,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813955192] [2025-01-09 03:49:29,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813955192] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:49:29,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:49:29,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 03:49:29,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629460687] [2025-01-09 03:49:29,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:49:29,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:49:29,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:49:29,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:49:29,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:49:29,886 INFO L87 Difference]: Start difference. First operand 415 states and 624 transitions. Second operand has 8 states, 7 states have (on average 13.285714285714286) internal successors, (93), 8 states have internal predecessors, (93), 4 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-01-09 03:49:30,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:49:30,023 INFO L93 Difference]: Finished difference Result 806 states and 1219 transitions. [2025-01-09 03:49:30,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 03:49:30,024 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 13.285714285714286) internal successors, (93), 8 states have internal predecessors, (93), 4 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 156 [2025-01-09 03:49:30,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:49:30,027 INFO L225 Difference]: With dead ends: 806 [2025-01-09 03:49:30,027 INFO L226 Difference]: Without dead ends: 418 [2025-01-09 03:49:30,028 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:49:30,028 INFO L435 NwaCegarLoop]: 514 mSDtfsCounter, 5 mSDsluCounter, 3055 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 3569 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:49:30,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 3569 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:49:30,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2025-01-09 03:49:30,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 418. [2025-01-09 03:49:30,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 321 states have (on average 1.5015576323987538) internal successors, (482), 327 states have internal predecessors, (482), 69 states have call successors, (69), 24 states have call predecessors, (69), 27 states have return successors, (80), 68 states have call predecessors, (80), 68 states have call successors, (80) [2025-01-09 03:49:30,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 631 transitions. [2025-01-09 03:49:30,045 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 631 transitions. Word has length 156 [2025-01-09 03:49:30,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:49:30,045 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 631 transitions. [2025-01-09 03:49:30,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 13.285714285714286) internal successors, (93), 8 states have internal predecessors, (93), 4 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-01-09 03:49:30,046 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 631 transitions. [2025-01-09 03:49:30,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-01-09 03:49:30,047 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:49:30,048 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:49:30,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 03:49:30,048 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:49:30,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:49:30,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1593940613, now seen corresponding path program 1 times [2025-01-09 03:49:30,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:49:30,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430890338] [2025-01-09 03:49:30,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:49:30,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:49:30,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-01-09 03:49:30,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-01-09 03:49:30,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:49:30,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:49:30,166 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-01-09 03:49:30,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:49:30,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430890338] [2025-01-09 03:49:30,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430890338] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:49:30,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:49:30,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:49:30,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165384415] [2025-01-09 03:49:30,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:49:30,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:49:30,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:49:30,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:49:30,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:49:30,170 INFO L87 Difference]: Start difference. First operand 418 states and 631 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 3 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-01-09 03:49:30,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:49:30,221 INFO L93 Difference]: Finished difference Result 808 states and 1227 transitions. [2025-01-09 03:49:30,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:49:30,221 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 3 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 157 [2025-01-09 03:49:30,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:49:30,224 INFO L225 Difference]: With dead ends: 808 [2025-01-09 03:49:30,224 INFO L226 Difference]: Without dead ends: 420 [2025-01-09 03:49:30,226 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:49:30,227 INFO L435 NwaCegarLoop]: 518 mSDtfsCounter, 0 mSDsluCounter, 1537 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2055 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:49:30,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2055 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:49:30,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2025-01-09 03:49:30,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 418. [2025-01-09 03:49:30,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 321 states have (on average 1.5015576323987538) internal successors, (482), 327 states have internal predecessors, (482), 69 states have call successors, (69), 24 states have call predecessors, (69), 27 states have return successors, (80), 68 states have call predecessors, (80), 68 states have call successors, (80) [2025-01-09 03:49:30,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 631 transitions. [2025-01-09 03:49:30,244 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 631 transitions. Word has length 157 [2025-01-09 03:49:30,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:49:30,245 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 631 transitions. [2025-01-09 03:49:30,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 3 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-01-09 03:49:30,245 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 631 transitions. [2025-01-09 03:49:30,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-01-09 03:49:30,247 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:49:30,247 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:49:30,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 03:49:30,248 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:49:30,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:49:30,248 INFO L85 PathProgramCache]: Analyzing trace with hash 973881721, now seen corresponding path program 1 times [2025-01-09 03:49:30,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:49:30,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457104505] [2025-01-09 03:49:30,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:49:30,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:49:30,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-01-09 03:49:30,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-01-09 03:49:30,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:49:30,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:49:30,344 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-01-09 03:49:30,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:49:30,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457104505] [2025-01-09 03:49:30,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457104505] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:49:30,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2026804251] [2025-01-09 03:49:30,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:49:30,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:49:30,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:49:30,352 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:49:30,355 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:49:30,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-01-09 03:49:30,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-01-09 03:49:30,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:49:30,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:49:30,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 1217 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:49:30,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:49:30,634 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-01-09 03:49:30,635 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:49:30,753 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-01-09 03:49:30,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2026804251] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:49:30,754 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:49:30,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-09 03:49:30,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986208819] [2025-01-09 03:49:30,755 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:49:30,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:49:30,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:49:30,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:49:30,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:49:30,757 INFO L87 Difference]: Start difference. First operand 418 states and 631 transitions. Second operand has 7 states, 7 states have (on average 17.428571428571427) internal successors, (122), 7 states have internal predecessors, (122), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-01-09 03:49:30,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:49:30,868 INFO L93 Difference]: Finished difference Result 970 states and 1518 transitions. [2025-01-09 03:49:30,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:49:30,868 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.428571428571427) internal successors, (122), 7 states have internal predecessors, (122), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 157 [2025-01-09 03:49:30,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:49:30,874 INFO L225 Difference]: With dead ends: 970 [2025-01-09 03:49:30,874 INFO L226 Difference]: Without dead ends: 764 [2025-01-09 03:49:30,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 311 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:49:30,875 INFO L435 NwaCegarLoop]: 558 mSDtfsCounter, 317 mSDsluCounter, 1895 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 2453 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:49:30,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 2453 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:49:30,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2025-01-09 03:49:30,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 740. [2025-01-09 03:49:30,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 740 states, 579 states have (on average 1.5785837651122625) internal successors, (914), 585 states have internal predecessors, (914), 133 states have call successors, (133), 24 states have call predecessors, (133), 27 states have return successors, (154), 132 states have call predecessors, (154), 132 states have call successors, (154) [2025-01-09 03:49:30,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 1201 transitions. [2025-01-09 03:49:30,903 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 1201 transitions. Word has length 157 [2025-01-09 03:49:30,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:49:30,904 INFO L471 AbstractCegarLoop]: Abstraction has 740 states and 1201 transitions. [2025-01-09 03:49:30,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.428571428571427) internal successors, (122), 7 states have internal predecessors, (122), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-01-09 03:49:30,904 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 1201 transitions. [2025-01-09 03:49:30,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-01-09 03:49:30,908 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:49:30,908 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:49:30,916 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:49:31,112 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,SelfDestructingSolverStorable11 [2025-01-09 03:49:31,112 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:49:31,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:49:31,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1580301423, now seen corresponding path program 1 times [2025-01-09 03:49:31,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:49:31,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877771450] [2025-01-09 03:49:31,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:49:31,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:49:31,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-01-09 03:49:31,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-09 03:49:31,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:49:31,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:49:31,178 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-01-09 03:49:31,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:49:31,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877771450] [2025-01-09 03:49:31,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877771450] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:49:31,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:49:31,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:49:31,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454921907] [2025-01-09 03:49:31,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:49:31,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:49:31,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:49:31,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:49:31,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:49:31,180 INFO L87 Difference]: Start difference. First operand 740 states and 1201 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 03:49:31,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:49:31,221 INFO L93 Difference]: Finished difference Result 1737 states and 2866 transitions. [2025-01-09 03:49:31,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:49:31,223 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 164 [2025-01-09 03:49:31,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:49:31,229 INFO L225 Difference]: With dead ends: 1737 [2025-01-09 03:49:31,229 INFO L226 Difference]: Without dead ends: 1066 [2025-01-09 03:49:31,232 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:49:31,233 INFO L435 NwaCegarLoop]: 546 mSDtfsCounter, 105 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 1072 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:49:31,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 1072 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:49:31,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1066 states. [2025-01-09 03:49:31,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1066 to 1058. [2025-01-09 03:49:31,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1058 states, 833 states have (on average 1.5990396158463385) internal successors, (1332), 839 states have internal predecessors, (1332), 197 states have call successors, (197), 24 states have call predecessors, (197), 27 states have return successors, (228), 196 states have call predecessors, (228), 196 states have call successors, (228) [2025-01-09 03:49:31,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1058 states to 1058 states and 1757 transitions. [2025-01-09 03:49:31,278 INFO L78 Accepts]: Start accepts. Automaton has 1058 states and 1757 transitions. Word has length 164 [2025-01-09 03:49:31,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:49:31,278 INFO L471 AbstractCegarLoop]: Abstraction has 1058 states and 1757 transitions. [2025-01-09 03:49:31,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 03:49:31,279 INFO L276 IsEmpty]: Start isEmpty. Operand 1058 states and 1757 transitions. [2025-01-09 03:49:31,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-01-09 03:49:31,285 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:49:31,285 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:49:31,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 03:49:31,286 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:49:31,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:49:31,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1675771857, now seen corresponding path program 1 times [2025-01-09 03:49:31,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:49:31,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945501630] [2025-01-09 03:49:31,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:49:31,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:49:31,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-09 03:49:31,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-09 03:49:31,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:49:31,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:49:31,340 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-01-09 03:49:31,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:49:31,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945501630] [2025-01-09 03:49:31,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945501630] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:49:31,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:49:31,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:49:31,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935085854] [2025-01-09 03:49:31,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:49:31,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:49:31,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:49:31,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:49:31,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:49:31,342 INFO L87 Difference]: Start difference. First operand 1058 states and 1757 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 03:49:31,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:49:31,380 INFO L93 Difference]: Finished difference Result 2500 states and 4182 transitions. [2025-01-09 03:49:31,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:49:31,381 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 165 [2025-01-09 03:49:31,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:49:31,390 INFO L225 Difference]: With dead ends: 2500 [2025-01-09 03:49:31,390 INFO L226 Difference]: Without dead ends: 1562 [2025-01-09 03:49:31,394 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:49:31,394 INFO L435 NwaCegarLoop]: 529 mSDtfsCounter, 103 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 1050 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:49:31,394 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 1050 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:49:31,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1562 states. [2025-01-09 03:49:31,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1562 to 1554. [2025-01-09 03:49:31,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1554 states, 1234 states have (on average 1.613452188006483) internal successors, (1991), 1240 states have internal predecessors, (1991), 292 states have call successors, (292), 24 states have call predecessors, (292), 27 states have return successors, (323), 291 states have call predecessors, (323), 291 states have call successors, (323) [2025-01-09 03:49:31,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1554 states to 1554 states and 2606 transitions. [2025-01-09 03:49:31,465 INFO L78 Accepts]: Start accepts. Automaton has 1554 states and 2606 transitions. Word has length 165 [2025-01-09 03:49:31,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:49:31,465 INFO L471 AbstractCegarLoop]: Abstraction has 1554 states and 2606 transitions. [2025-01-09 03:49:31,465 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 03:49:31,466 INFO L276 IsEmpty]: Start isEmpty. Operand 1554 states and 2606 transitions. [2025-01-09 03:49:31,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-01-09 03:49:31,473 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:49:31,473 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:49:31,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 03:49:31,473 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:49:31,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:49:31,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1804552849, now seen corresponding path program 1 times [2025-01-09 03:49:31,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:49:31,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734925832] [2025-01-09 03:49:31,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:49:31,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:49:31,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-01-09 03:49:31,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-01-09 03:49:31,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:49:31,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:49:31,523 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-01-09 03:49:31,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:49:31,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734925832] [2025-01-09 03:49:31,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734925832] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:49:31,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:49:31,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:49:31,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731384109] [2025-01-09 03:49:31,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:49:31,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:49:31,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:49:31,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:49:31,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:49:31,525 INFO L87 Difference]: Start difference. First operand 1554 states and 2606 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 03:49:31,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:49:31,572 INFO L93 Difference]: Finished difference Result 3624 states and 6129 transitions. [2025-01-09 03:49:31,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:49:31,573 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 166 [2025-01-09 03:49:31,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:49:31,583 INFO L225 Difference]: With dead ends: 3624 [2025-01-09 03:49:31,583 INFO L226 Difference]: Without dead ends: 2311 [2025-01-09 03:49:31,588 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:49:31,589 INFO L435 NwaCegarLoop]: 527 mSDtfsCounter, 101 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 1045 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:49:31,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 1045 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:49:31,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2311 states. [2025-01-09 03:49:31,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2311 to 2303. [2025-01-09 03:49:31,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2303 states, 1860 states have (on average 1.624731182795699) internal successors, (3022), 1866 states have internal predecessors, (3022), 415 states have call successors, (415), 24 states have call predecessors, (415), 27 states have return successors, (462), 414 states have call predecessors, (462), 414 states have call successors, (462) [2025-01-09 03:49:31,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2303 states to 2303 states and 3899 transitions. [2025-01-09 03:49:31,668 INFO L78 Accepts]: Start accepts. Automaton has 2303 states and 3899 transitions. Word has length 166 [2025-01-09 03:49:31,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:49:31,668 INFO L471 AbstractCegarLoop]: Abstraction has 2303 states and 3899 transitions. [2025-01-09 03:49:31,668 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 03:49:31,668 INFO L276 IsEmpty]: Start isEmpty. Operand 2303 states and 3899 transitions. [2025-01-09 03:49:31,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-01-09 03:49:31,680 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:49:31,680 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, 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:49:31,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 03:49:31,680 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:49:31,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:49:31,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1571834994, now seen corresponding path program 1 times [2025-01-09 03:49:31,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:49:31,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441910701] [2025-01-09 03:49:31,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:49:31,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:49:31,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-01-09 03:49:31,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-01-09 03:49:31,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:49:31,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:49:31,755 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-01-09 03:49:31,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:49:31,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441910701] [2025-01-09 03:49:31,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441910701] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:49:31,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:49:31,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:49:31,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039644666] [2025-01-09 03:49:31,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:49:31,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:49:31,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:49:31,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:49:31,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:49:31,757 INFO L87 Difference]: Start difference. First operand 2303 states and 3899 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 03:49:31,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:49:31,825 INFO L93 Difference]: Finished difference Result 5372 states and 9160 transitions. [2025-01-09 03:49:31,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:49:31,825 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 167 [2025-01-09 03:49:31,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:49:31,843 INFO L225 Difference]: With dead ends: 5372 [2025-01-09 03:49:31,844 INFO L226 Difference]: Without dead ends: 3507 [2025-01-09 03:49:31,850 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:49:31,850 INFO L435 NwaCegarLoop]: 527 mSDtfsCounter, 99 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 1045 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:49:31,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 1045 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:49:31,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3507 states. [2025-01-09 03:49:31,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3507 to 3499. [2025-01-09 03:49:31,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3499 states, 2877 states have (on average 1.632255822036844) internal successors, (4696), 2883 states have internal predecessors, (4696), 594 states have call successors, (594), 24 states have call predecessors, (594), 27 states have return successors, (667), 593 states have call predecessors, (667), 593 states have call successors, (667) [2025-01-09 03:49:31,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3499 states to 3499 states and 5957 transitions. [2025-01-09 03:49:31,975 INFO L78 Accepts]: Start accepts. Automaton has 3499 states and 5957 transitions. Word has length 167 [2025-01-09 03:49:31,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:49:31,976 INFO L471 AbstractCegarLoop]: Abstraction has 3499 states and 5957 transitions. [2025-01-09 03:49:31,976 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 03:49:31,976 INFO L276 IsEmpty]: Start isEmpty. Operand 3499 states and 5957 transitions. [2025-01-09 03:49:31,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-01-09 03:49:31,992 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:49:31,992 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, 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:49:31,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 03:49:31,993 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:49:31,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:49:31,993 INFO L85 PathProgramCache]: Analyzing trace with hash 237664973, now seen corresponding path program 1 times [2025-01-09 03:49:31,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:49:31,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51530030] [2025-01-09 03:49:31,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:49:31,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:49:32,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-01-09 03:49:32,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-01-09 03:49:32,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:49:32,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:49:32,071 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-01-09 03:49:32,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:49:32,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51530030] [2025-01-09 03:49:32,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51530030] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:49:32,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:49:32,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:49:32,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111304093] [2025-01-09 03:49:32,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:49:32,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:49:32,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:49:32,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:49:32,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:49:32,074 INFO L87 Difference]: Start difference. First operand 3499 states and 5957 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 03:49:32,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:49:32,229 INFO L93 Difference]: Finished difference Result 8243 states and 14130 transitions. [2025-01-09 03:49:32,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:49:32,230 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 168 [2025-01-09 03:49:32,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:49:32,261 INFO L225 Difference]: With dead ends: 8243 [2025-01-09 03:49:32,261 INFO L226 Difference]: Without dead ends: 5483 [2025-01-09 03:49:32,274 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:49:32,274 INFO L435 NwaCegarLoop]: 542 mSDtfsCounter, 97 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 1059 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:49:32,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 1059 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:49:32,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5483 states. [2025-01-09 03:49:32,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5483 to 5475. [2025-01-09 03:49:32,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5475 states, 4477 states have (on average 1.628992628992629) internal successors, (7293), 4483 states have internal predecessors, (7293), 970 states have call successors, (970), 24 states have call predecessors, (970), 27 states have return successors, (1087), 969 states have call predecessors, (1087), 969 states have call successors, (1087) [2025-01-09 03:49:32,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5475 states to 5475 states and 9350 transitions. [2025-01-09 03:49:32,547 INFO L78 Accepts]: Start accepts. Automaton has 5475 states and 9350 transitions. Word has length 168 [2025-01-09 03:49:32,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:49:32,547 INFO L471 AbstractCegarLoop]: Abstraction has 5475 states and 9350 transitions. [2025-01-09 03:49:32,548 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 03:49:32,548 INFO L276 IsEmpty]: Start isEmpty. Operand 5475 states and 9350 transitions. [2025-01-09 03:49:32,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-01-09 03:49:32,572 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:49:32,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, 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:49:32,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 03:49:32,573 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:49:32,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:49:32,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1602105398, now seen corresponding path program 1 times [2025-01-09 03:49:32,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:49:32,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246855019] [2025-01-09 03:49:32,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:49:32,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:49:32,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-01-09 03:49:32,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-01-09 03:49:32,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:49:32,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:49:32,620 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-01-09 03:49:32,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:49:32,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246855019] [2025-01-09 03:49:32,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246855019] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:49:32,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:49:32,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:49:32,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551664682] [2025-01-09 03:49:32,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:49:32,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:49:32,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:49:32,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:49:32,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:49:32,622 INFO L87 Difference]: Start difference. First operand 5475 states and 9350 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 03:49:32,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:49:32,802 INFO L93 Difference]: Finished difference Result 13447 states and 23107 transitions. [2025-01-09 03:49:32,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:49:32,803 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 169 [2025-01-09 03:49:32,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:49:32,852 INFO L225 Difference]: With dead ends: 13447 [2025-01-09 03:49:32,853 INFO L226 Difference]: Without dead ends: 9072 [2025-01-09 03:49:32,929 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:49:32,930 INFO L435 NwaCegarLoop]: 527 mSDtfsCounter, 95 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 1048 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:49:32,931 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 1048 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:49:32,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9072 states. [2025-01-09 03:49:33,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9072 to 9064. [2025-01-09 03:49:33,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9064 states, 7460 states have (on average 1.6280160857908847) internal successors, (12145), 7466 states have internal predecessors, (12145), 1576 states have call successors, (1576), 24 states have call predecessors, (1576), 27 states have return successors, (1771), 1575 states have call predecessors, (1771), 1575 states have call successors, (1771) [2025-01-09 03:49:33,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9064 states to 9064 states and 15492 transitions. [2025-01-09 03:49:33,289 INFO L78 Accepts]: Start accepts. Automaton has 9064 states and 15492 transitions. Word has length 169 [2025-01-09 03:49:33,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:49:33,290 INFO L471 AbstractCegarLoop]: Abstraction has 9064 states and 15492 transitions. [2025-01-09 03:49:33,290 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 03:49:33,291 INFO L276 IsEmpty]: Start isEmpty. Operand 9064 states and 15492 transitions. [2025-01-09 03:49:33,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-01-09 03:49:33,327 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:49:33,327 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, 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:49:33,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 03:49:33,327 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:49:33,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:49:33,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1123919419, now seen corresponding path program 1 times [2025-01-09 03:49:33,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:49:33,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061294150] [2025-01-09 03:49:33,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:49:33,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:49:33,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-01-09 03:49:33,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-01-09 03:49:33,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:49:33,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:49:33,379 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-01-09 03:49:33,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:49:33,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061294150] [2025-01-09 03:49:33,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061294150] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:49:33,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:49:33,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:49:33,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044299639] [2025-01-09 03:49:33,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:49:33,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:49:33,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:49:33,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:49:33,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:49:33,381 INFO L87 Difference]: Start difference. First operand 9064 states and 15492 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 03:49:33,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:49:33,732 INFO L93 Difference]: Finished difference Result 23393 states and 40134 transitions. [2025-01-09 03:49:33,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:49:33,732 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 170 [2025-01-09 03:49:33,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:49:33,801 INFO L225 Difference]: With dead ends: 23393 [2025-01-09 03:49:33,801 INFO L226 Difference]: Without dead ends: 15859 [2025-01-09 03:49:33,832 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:49:33,832 INFO L435 NwaCegarLoop]: 533 mSDtfsCounter, 93 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 1056 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:49:33,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 1056 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:49:33,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15859 states. [2025-01-09 03:49:34,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15859 to 15851. [2025-01-09 03:49:34,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15851 states, 13044 states have (on average 1.619211898190739) internal successors, (21121), 13050 states have internal predecessors, (21121), 2779 states have call successors, (2779), 24 states have call predecessors, (2779), 27 states have return successors, (3118), 2778 states have call predecessors, (3118), 2778 states have call successors, (3118) [2025-01-09 03:49:34,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15851 states to 15851 states and 27018 transitions. [2025-01-09 03:49:34,572 INFO L78 Accepts]: Start accepts. Automaton has 15851 states and 27018 transitions. Word has length 170 [2025-01-09 03:49:34,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:49:34,573 INFO L471 AbstractCegarLoop]: Abstraction has 15851 states and 27018 transitions. [2025-01-09 03:49:34,573 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 03:49:34,573 INFO L276 IsEmpty]: Start isEmpty. Operand 15851 states and 27018 transitions. [2025-01-09 03:49:34,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-01-09 03:49:34,620 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:49:34,620 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, 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:49:34,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 03:49:34,620 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:49:34,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:49:34,621 INFO L85 PathProgramCache]: Analyzing trace with hash -2069422601, now seen corresponding path program 1 times [2025-01-09 03:49:34,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:49:34,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744661286] [2025-01-09 03:49:34,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:49:34,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:49:34,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 03:49:34,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 03:49:34,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:49:34,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:49:34,670 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-01-09 03:49:34,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:49:34,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744661286] [2025-01-09 03:49:34,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744661286] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:49:34,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:49:34,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:49:34,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903148048] [2025-01-09 03:49:34,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:49:34,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:49:34,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:49:34,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:49:34,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:49:34,672 INFO L87 Difference]: Start difference. First operand 15851 states and 27018 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 03:49:35,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:49:35,187 INFO L93 Difference]: Finished difference Result 41919 states and 71753 transitions. [2025-01-09 03:49:35,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:49:35,188 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 171 [2025-01-09 03:49:35,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:49:35,295 INFO L225 Difference]: With dead ends: 41919 [2025-01-09 03:49:35,295 INFO L226 Difference]: Without dead ends: 28211 [2025-01-09 03:49:35,337 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:49:35,337 INFO L435 NwaCegarLoop]: 527 mSDtfsCounter, 91 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 1048 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:49:35,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 1048 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:49:35,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28211 states. [2025-01-09 03:49:36,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28211 to 28203. [2025-01-09 03:49:36,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28203 states, 23357 states have (on average 1.6150190521042942) internal successors, (37722), 23363 states have internal predecessors, (37722), 4818 states have call successors, (4818), 24 states have call predecessors, (4818), 27 states have return successors, (5431), 4817 states have call predecessors, (5431), 4817 states have call successors, (5431) [2025-01-09 03:49:36,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28203 states to 28203 states and 47971 transitions. [2025-01-09 03:49:36,440 INFO L78 Accepts]: Start accepts. Automaton has 28203 states and 47971 transitions. Word has length 171 [2025-01-09 03:49:36,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:49:36,441 INFO L471 AbstractCegarLoop]: Abstraction has 28203 states and 47971 transitions. [2025-01-09 03:49:36,441 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 03:49:36,441 INFO L276 IsEmpty]: Start isEmpty. Operand 28203 states and 47971 transitions. [2025-01-09 03:49:36,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-01-09 03:49:36,514 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:49:36,514 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, 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:49:36,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 03:49:36,515 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:49:36,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:49:36,516 INFO L85 PathProgramCache]: Analyzing trace with hash -2146332387, now seen corresponding path program 1 times [2025-01-09 03:49:36,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:49:36,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88110004] [2025-01-09 03:49:36,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:49:36,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:49:36,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-01-09 03:49:36,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-01-09 03:49:36,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:49:36,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:49:36,578 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-01-09 03:49:36,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:49:36,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88110004] [2025-01-09 03:49:36,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88110004] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:49:36,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:49:36,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:49:36,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134104936] [2025-01-09 03:49:36,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:49:36,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:49:36,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:49:36,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:49:36,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:49:36,581 INFO L87 Difference]: Start difference. First operand 28203 states and 47971 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 03:49:37,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:49:37,684 INFO L93 Difference]: Finished difference Result 76846 states and 131145 transitions. [2025-01-09 03:49:37,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:49:37,684 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 172 [2025-01-09 03:49:37,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:49:37,866 INFO L225 Difference]: With dead ends: 76846 [2025-01-09 03:49:37,866 INFO L226 Difference]: Without dead ends: 51521 [2025-01-09 03:49:37,920 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:49:37,921 INFO L435 NwaCegarLoop]: 534 mSDtfsCounter, 89 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 1056 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:49:37,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 1056 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:49:37,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51521 states. [2025-01-09 03:49:39,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51521 to 51513. [2025-01-09 03:49:39,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51513 states, 42952 states have (on average 1.6092847830135966) internal successors, (69122), 42958 states have internal predecessors, (69122), 8533 states have call successors, (8533), 24 states have call predecessors, (8533), 27 states have return successors, (9678), 8532 states have call predecessors, (9678), 8532 states have call successors, (9678) [2025-01-09 03:49:39,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51513 states to 51513 states and 87333 transitions. [2025-01-09 03:49:39,735 INFO L78 Accepts]: Start accepts. Automaton has 51513 states and 87333 transitions. Word has length 172 [2025-01-09 03:49:39,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:49:39,735 INFO L471 AbstractCegarLoop]: Abstraction has 51513 states and 87333 transitions. [2025-01-09 03:49:39,736 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 03:49:39,736 INFO L276 IsEmpty]: Start isEmpty. Operand 51513 states and 87333 transitions. [2025-01-09 03:49:39,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-01-09 03:49:39,840 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:49:39,840 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, 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:49:39,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 03:49:39,841 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:49:39,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:49:39,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1826808087, now seen corresponding path program 1 times [2025-01-09 03:49:39,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:49:39,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560563536] [2025-01-09 03:49:39,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:49:39,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:49:39,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-01-09 03:49:39,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-01-09 03:49:39,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:49:39,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:49:39,902 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-01-09 03:49:39,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:49:39,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560563536] [2025-01-09 03:49:39,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560563536] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:49:39,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:49:39,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:49:39,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899518139] [2025-01-09 03:49:39,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:49:39,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:49:39,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:49:39,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:49:39,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:49:39,904 INFO L87 Difference]: Start difference. First operand 51513 states and 87333 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 03:49:41,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:49:41,457 INFO L93 Difference]: Finished difference Result 96098 states and 163244 transitions. [2025-01-09 03:49:41,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:49:41,457 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 173 [2025-01-09 03:49:41,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:49:41,906 INFO L225 Difference]: With dead ends: 96098 [2025-01-09 03:49:41,906 INFO L226 Difference]: Without dead ends: 95892 [2025-01-09 03:49:41,972 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:49:41,974 INFO L435 NwaCegarLoop]: 536 mSDtfsCounter, 84 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 1062 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:49:41,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 1062 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:49:42,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95892 states. [2025-01-09 03:49:45,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95892 to 95884. [2025-01-09 03:49:45,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95884 states, 80524 states have (on average 1.6020565297302667) internal successors, (129004), 80530 states have internal predecessors, (129004), 15332 states have call successors, (15332), 24 states have call predecessors, (15332), 27 states have return successors, (17523), 15331 states have call predecessors, (17523), 15331 states have call successors, (17523) [2025-01-09 03:49:45,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95884 states to 95884 states and 161859 transitions. [2025-01-09 03:49:45,849 INFO L78 Accepts]: Start accepts. Automaton has 95884 states and 161859 transitions. Word has length 173 [2025-01-09 03:49:45,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:49:45,849 INFO L471 AbstractCegarLoop]: Abstraction has 95884 states and 161859 transitions. [2025-01-09 03:49:45,849 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 03:49:45,849 INFO L276 IsEmpty]: Start isEmpty. Operand 95884 states and 161859 transitions. [2025-01-09 03:49:46,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-01-09 03:49:46,054 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:49:46,054 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, 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:49:46,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 03:49:46,055 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:49:46,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:49:46,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1616928476, now seen corresponding path program 1 times [2025-01-09 03:49:46,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:49:46,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143074078] [2025-01-09 03:49:46,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:49:46,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:49:46,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-01-09 03:49:46,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-01-09 03:49:46,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:49:46,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:49:46,621 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-01-09 03:49:46,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:49:46,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143074078] [2025-01-09 03:49:46,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143074078] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:49:46,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [497686197] [2025-01-09 03:49:46,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:49:46,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:49:46,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:49:46,626 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:49:46,627 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:49:46,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-01-09 03:49:46,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-01-09 03:49:46,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:49:46,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:49:46,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 1269 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-09 03:49:46,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:49:47,107 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 03:49:47,107 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:49:47,431 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-01-09 03:49:47,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [497686197] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:49:47,432 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:49:47,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 9] total 28 [2025-01-09 03:49:47,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946430436] [2025-01-09 03:49:47,432 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:49:47,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-01-09 03:49:47,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:49:47,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-01-09 03:49:47,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=688, Unknown=0, NotChecked=0, Total=756 [2025-01-09 03:49:47,435 INFO L87 Difference]: Start difference. First operand 95884 states and 161859 transitions. Second operand has 28 states, 26 states have (on average 9.807692307692308) internal successors, (255), 24 states have internal predecessors, (255), 9 states have call successors, (51), 8 states have call predecessors, (51), 12 states have return successors, (46), 11 states have call predecessors, (46), 9 states have call successors, (46)